/*
$Log$
+Revision 1.37 2003/07/22 15:56:14 hristov
+Implementing ESD functionality in the NewIO (Yu.Belikov)
+
+Revision 1.35.2.3 2003/07/15 09:58:03 hristov
+Corrected back-propagation (Yu.Belikov)
+
+Revision 1.35.2.2 2003/07/14 09:19:33 hristov
+TOF included in the combined PID (Yu.Belikov)
+
+Revision 1.35.2.1 2003/07/11 10:53:01 hristov
+Inward refit for TPC and TRD in the ESD schema (T.Kuhr)
+
+Revision 1.35 2003/05/23 10:08:51 hristov
+SetLabel replaced by SetNumber (Yu.Belikov)
+
+Revision 1.34 2003/05/22 13:57:48 hristov
+First implementation of ESD classes (Yu.Belikov)
+
+Revision 1.32 2003/04/10 10:36:54 hristov
+Code for unified TPC/TRD tracking (S.Radomski)
+
+Revision 1.31 2003/03/19 17:14:11 hristov
+Load/UnloadClusters added to the base class and the derived classes changed correspondingly. Possibility to give 2 input files for ITS and TPC tracks in PropagateBack. TRD tracker uses fEventN from the base class (T.Kuhr)
+
+Revision 1.30 2003/02/28 16:13:32 hristov
+Typos corrected
+
+Revision 1.29 2003/02/28 15:18:16 hristov
+Corrections suggested by J.Chudoba
+
+Revision 1.28 2003/02/27 16:15:52 hristov
+Code for inward refitting (S.Radomski)
+
+Revision 1.27 2003/02/25 16:47:58 hristov
+allow back propagation for more than 1 event (J.Chudoba)
+
+Revision 1.26 2003/02/19 08:49:46 hristov
+Track time measurement (S.Radomski)
+
+Revision 1.25 2003/01/28 16:43:35 hristov
+Additional protection: to be discussed with the Root team (M.Ivanov)
+
+Revision 1.24 2002/11/19 16:13:24 hristov
+stdlib.h included to declare exit() on HP
+
+Revision 1.23 2002/11/19 11:50:08 hristov
+Removing CONTAINERS (Yu.Belikov)
+
+Revision 1.19 2002/07/19 07:31:40 kowal2
+Improvement in tracking by J. Belikov
+
+Revision 1.18 2002/05/13 07:33:52 kowal2
+Added protection in Int_t AliTPCtracker::AliTPCRow::Find(Double_t y) const
+in the case of defined region of interests.
+
+Revision 1.17 2002/03/18 17:59:13 kowal2
+Chnges in the pad geometry - 3 pad lengths introduced.
+
+Revision 1.16 2001/11/08 16:39:03 hristov
+Additional protection (M.Masera)
+
+Revision 1.15 2001/11/08 16:36:33 hristov
+Updated V2 stream of tracking (Yu.Belikov). The new long waited features are: 1) Possibility to pass the primary vertex position to the trackers (both for the TPC and the ITS) 2) Possibility to specify the number of tracking passes together with applying (or not applying) the vertex constraint (ITS only) 3) Possibility to make some use of partial PID provided by the TPC when doing tracking in the ITS (ITS only) 4) V0 reconstruction with a helix minimisation of the DCA. (new macros: AliV0FindVertices.C and AliV0Comparison.C) 4a) ( Consequence of the 4) ) All the efficiencies and resolutions are from now on calculated including *secondary*particles* too. (Don't be surprised by the drop in efficiency etc)
+
+Revision 1.14 2001/10/21 19:04:55 hristov
+Several patches were done to adapt the barel reconstruction to the multi-event case. Some memory leaks were corrected. (Yu.Belikov)
+
+Revision 1.13 2001/07/23 12:01:30 hristov
+Initialisation added
+
+Revision 1.12 2001/07/20 14:32:44 kowal2
+Processing of many events possible now
+
+Revision 1.11 2001/05/23 08:50:10 hristov
+Weird inline removed
+
+Revision 1.10 2001/05/16 14:57:25 alibrary
+New files for folders and Stack
+
+Revision 1.9 2001/05/11 07:16:56 hristov
+Fix needed on Sun and Alpha
+
+Revision 1.8 2001/05/08 15:00:15 hristov
+Corrections for tracking in arbitrary magnenetic field. Changes towards a concept of global Alice track. Back propagation of reconstructed tracks (Yu.Belikov)
+
+Revision 1.5 2000/12/20 07:51:59 kowal2
+Changes suggested by Alessandra and Paolo to avoid overlapped
+data fields in encapsulated classes.
+
+Revision 1.4 2000/11/02 07:27:16 kowal2
+code corrections
+
Revision 1.2 2000/06/30 12:07:50 kowal2
Updated from the TPC-PreRelease branch
//
// Origin: Iouri Belikov, CERN, Jouri.Belikov@cern.ch
//-------------------------------------------------------
-
#include <TObjArray.h>
+#include <TError.h>
#include <TFile.h>
#include <TTree.h>
-#include <iostream.h>
+#include <stdlib.h>
+
+#include "AliESD.h"
#include "AliTPCtracker.h"
#include "AliTPCcluster.h"
-#include "AliTPCClustersArray.h"
-#include "AliTPCClustersRow.h"
+#include "AliTPCParam.h"
+#include "AliClusters.h"
-const AliTPCParam *AliTPCtracker::AliTPCSector::fgParam;
+ClassImp(AliTPCtracker)
+
+//_____________________________________________________________________________
+AliTPCtracker::AliTPCtracker(const AliTPCParam *par):
+AliTracker(), fkNIS(par->GetNInnerSector()/2), fkNOS(par->GetNOuterSector()/2)
+{
+ //---------------------------------------------------------------------
+ // The main TPC tracker constructor
+ //---------------------------------------------------------------------
+ fInnerSec=new AliTPCSector[fkNIS];
+ fOuterSec=new AliTPCSector[fkNOS];
+
+ Int_t i;
+ for (i=0; i<fkNIS; i++) fInnerSec[i].Setup(par,0);
+ for (i=0; i<fkNOS; i++) fOuterSec[i].Setup(par,1);
+
+ fParam = (AliTPCParam*) par;
+ fSeeds=0;
+
+ // [SR 17.03.2003]
+
+ fBarrelFile = 0;
+ fBarrelTree = 0;
+ fBarrelArray = 0;
+ fBarrelTrack = 0;
+
+}
+
+//_____________________________________________________________________________
+AliTPCtracker::~AliTPCtracker() {
+ //------------------------------------------------------------------
+ // TPC tracker destructor
+ //------------------------------------------------------------------
+ delete[] fInnerSec;
+ delete[] fOuterSec;
+ if (fSeeds) {
+ fSeeds->Delete();
+ delete fSeeds;
+ }
+
+ // [SR, 01.04.2003]
+ if (fBarrelFile) {
+ fBarrelFile->Close();
+ delete fBarrelFile;
+ }
+}
+
+//_____________________________________________________________________________
+
+void AliTPCtracker::SetBarrelTree(const char *mode) {
+ //
+ // Creates a tree for BarrelTracks
+ // mode = "back" or "refit"
+ //
+ // [SR, 01.04.2003]
+ //
+
+ if (!IsStoringBarrel()) return;
+
+ TDirectory *sav = gDirectory;
+ if (!fBarrelFile) fBarrelFile = new TFile("AliBarrelTracks.root", "UPDATE");
+
+ char buff[40];
+ sprintf(buff, "BarrelTPC_%d_%s", GetEventNumber(), mode);
+
+ fBarrelFile->cd();
+ fBarrelTree = new TTree(buff, "Barrel TPC tracks");
+
+ if (!fBarrelArray) fBarrelArray = new TClonesArray("AliBarrelTrack", 4);
+ for(Int_t i=0; i<4; i++) new((*fBarrelArray)[i]) AliBarrelTrack();
+
+ fBarrelTree->Branch("tracks", &fBarrelArray);
+
+ sav->cd();
+}
+//_____________________________________________________________________________
+
+void AliTPCtracker::StoreBarrelTrack(AliTPCtrack *ps, Int_t refPlane, Int_t isIn) {
+ //
+ // Stores Track at a given reference plane
+ //
+ // refPlane: 1-4
+ // isIn: 1 - backward, 2 - refit
+ //
+
+ if (!IsStoringBarrel()) return;
+ if (refPlane < 0 || refPlane > 4) return;
+ if (isIn > 2) return;
+
+ static Int_t nClusters;
+ static Int_t nWrong;
+ static Double_t chi2;
+ static Int_t index;
+
+ Int_t newClusters, newWrong;
+ Double_t newChi2;
+
+ if ( (refPlane == 1 && isIn == kTrackBack) ||
+ (refPlane == 4 && isIn == kTrackRefit) ) {
+
+ fBarrelArray->Clear();
+ nClusters = nWrong = 0;
+ chi2 = 0.0;
+ index = 0;
+ }
+
+ // propagate
+ Double_t refX = 0;
+ if (refPlane == 1) refX = fParam->GetInnerRadiusLow();
+ if (refPlane == 2) refX = fParam->GetInnerRadiusUp();
+ if (refPlane == 3) refX = fParam->GetOuterRadiusLow();
+ if (refPlane == 4) refX = fParam->GetOuterRadiusUp();
+
+ ps->PropagateTo(refX);
+
+ fBarrelTrack = (AliBarrelTrack*)(*fBarrelArray)[index++];
+ ps->GetBarrelTrack(fBarrelTrack);
+
+ newClusters = ps->GetNumberOfClusters() - nClusters;
+ newWrong = ps->GetNWrong() - nWrong;
+ newChi2 = ps->GetChi2() - chi2;
+
+ nClusters = ps->GetNumberOfClusters();
+ nWrong = ps->GetNWrong();
+ chi2 = ps->GetChi2();
+
+ fBarrelTrack->SetNClusters(newClusters, newChi2);
+ fBarrelTrack->SetNWrongClusters(newWrong);
+ fBarrelTrack->SetRefPlane(refPlane, isIn);
+}
//_____________________________________________________________________________
Double_t SigmaY2(Double_t r, Double_t tgl, Double_t pt)
}
//_____________________________________________________________________________
-inline Double_t f1(Double_t x1,Double_t y1,
+Double_t f1(Double_t x1,Double_t y1,
Double_t x2,Double_t y2,
Double_t x3,Double_t y3)
{
//_____________________________________________________________________________
-inline Double_t f2(Double_t x1,Double_t y1,
+Double_t f2(Double_t x1,Double_t y1,
Double_t x2,Double_t y2,
Double_t x3,Double_t y3)
{
}
//_____________________________________________________________________________
-inline Double_t f3(Double_t x1,Double_t y1,
+Double_t f3(Double_t x1,Double_t y1,
Double_t x2,Double_t y2,
Double_t z1,Double_t z2)
{
}
//_____________________________________________________________________________
-Int_t AliTPCtracker::FindProlongation(AliTPCseed& t, const AliTPCSector *sec,
-Int_t s, Int_t rf)
-{
+Int_t AliTPCtracker::LoadClusters(TTree *cTree) {
+ //-----------------------------------------------------------------
+ // This function loads TPC clusters.
+ //-----------------------------------------------------------------
+ TBranch *branch=cTree->GetBranch("Segment");
+ if (!branch) {
+ Error("LoadClusters","Can't get the branch !");
+ return 1;
+ }
+
+ AliClusters carray, *addr=&carray;
+ carray.SetClass("AliTPCcluster");
+ carray.SetArray(0);
+ branch->SetAddress(&addr);
+
+ Int_t nentr=(Int_t)cTree->GetEntries();
+
+ for (Int_t i=0; i<nentr; i++) {
+ cTree->GetEvent(i);
+
+ Int_t ncl=carray.GetArray()->GetEntriesFast();
+
+ Int_t nir=fInnerSec->GetNRows(), nor=fOuterSec->GetNRows();
+ Int_t id=carray.GetID();
+ if ((id<0) || (id>2*(fkNIS*nir + fkNOS*nor))) {
+ Error("LoadClusters","Wrong index !");
+ exit(1);
+ }
+ Int_t outindex = 2*fkNIS*nir;
+ if (id<outindex) {
+ Int_t sec = id/nir;
+ Int_t row = id - sec*nir;
+ sec %= fkNIS;
+ AliTPCRow &padrow=fInnerSec[sec][row];
+ while (ncl--) {
+ AliTPCcluster *c=(AliTPCcluster*)carray[ncl];
+ padrow.InsertCluster(c,sec,row);
+ }
+ } else {
+ id -= outindex;
+ Int_t sec = id/nor;
+ Int_t row = id - sec*nor;
+ sec %= fkNOS;
+ AliTPCRow &padrow=fOuterSec[sec][row];
+ while (ncl--) {
+ AliTPCcluster *c=(AliTPCcluster*)carray[ncl];
+ padrow.InsertCluster(c,sec+fkNIS,row);
+ }
+ }
+ carray.GetArray()->Clear();
+ }
+
+ return 0;
+}
+
+//_____________________________________________________________________________
+void AliTPCtracker::UnloadClusters() {
+ //-----------------------------------------------------------------
+ // This function unloads TPC clusters.
+ //-----------------------------------------------------------------
+ Int_t i;
+ for (i=0; i<fkNIS; i++) {
+ Int_t nr=fInnerSec->GetNRows();
+ for (Int_t n=0; n<nr; n++) fInnerSec[i][n].ResetClusters();
+ }
+ for (i=0; i<fkNOS; i++) {
+ Int_t nr=fOuterSec->GetNRows();
+ for (Int_t n=0; n<nr; n++) fOuterSec[i][n].ResetClusters();
+ }
+}
+
+//_____________________________________________________________________________
+Int_t AliTPCtracker::FollowProlongation(AliTPCseed& t, Int_t rf) {
//-----------------------------------------------------------------
// This function tries to find a track prolongation.
//-----------------------------------------------------------------
- const Int_t kSKIP=(t.GetNumberOfClusters()<10) ?
- 10 : Int_t(0.5*sec->GetNRows());
+ Double_t xt=t.GetX();
+ const Int_t kSKIP=(t.GetNumberOfClusters()<10) ? kRowsToSkip :
+ Int_t(0.5*fSectors->GetNRows());
Int_t tryAgain=kSKIP;
- Double_t alpha=sec->GetAlpha();
- Int_t ns=Int_t(2*TMath::Pi()/alpha+0.5);
- for (Int_t nr=sec->GetRowNumber(t.GetX())-1; nr>=rf; nr--) {
- Double_t x=sec->GetX(nr), ymax=sec->GetMaxY(nr);
+ Double_t alpha=t.GetAlpha() - fSectors->GetAlphaShift();
+ if (alpha > 2.*TMath::Pi()) alpha -= 2.*TMath::Pi();
+ if (alpha < 0. ) alpha += 2.*TMath::Pi();
+ Int_t s=Int_t(alpha/fSectors->GetAlpha())%fN;
+
+ Int_t nrows=fSectors->GetRowNumber(xt)-1;
+ for (Int_t nr=nrows; nr>=rf; nr--) {
+ Double_t x=fSectors->GetX(nr), ymax=fSectors->GetMaxY(nr);
if (!t.PropagateTo(x)) return 0;
AliTPCcluster *cl=0;
UInt_t index=0;
- Double_t maxchi2=12.;
- const AliTPCRow &krow=sec[s][nr];
- Double_t sy2=SigmaY2(t.GetX(),t.GetTgl(),t.GetPt());
+ Double_t maxchi2=kMaxCHI2;
+ const AliTPCRow &krow=fSectors[s][nr];
+ Double_t pt=t.GetConvConst()/(100/0.299792458/0.2)/t.Get1Pt();
+ Double_t sy2=SigmaY2(t.GetX(),t.GetTgl(),pt);
Double_t sz2=SigmaZ2(t.GetX(),t.GetTgl());
Double_t road=4.*sqrt(t.GetSigmaY2() + sy2), y=t.GetY(), z=t.GetZ();
- if (road>30) {
+ if (road>kMaxROAD) {
if (t.GetNumberOfClusters()>4)
- cerr<<t.GetNumberOfClusters()
- <<"FindProlongation warning: Too broad road !\n";
+ Warning("FindProlongation","Too broad road !");
return 0;
}
}
}
if (cl) {
- Float_t l=sec->GetPadPitchWidth();
- t.SetSampledEdx(cl->GetQ()/l,t.GetNumberOfClusters());
- t.Update(cl,maxchi2,index);
- tryAgain=kSKIP;
+ Float_t l=fSectors->GetPadPitchWidth();
+ Float_t corr=1.; if (nr>63) corr=0.67; // new (third) pad response !
+ t.SetSampledEdx(cl->GetQ()/l*corr,t.GetNumberOfClusters());
+ if (!t.Update(cl,maxchi2,index)) {
+ if (!tryAgain--) return 0;
+ } else tryAgain=kSKIP;
} else {
if (tryAgain==0) break;
if (y > ymax) {
- s = (s+1) % ns;
- if (!t.Rotate(alpha)) return 0;
+ s = (s+1) % fN;
+ if (!t.Rotate(fSectors->GetAlpha())) return 0;
} else if (y <-ymax) {
- s = (s-1+ns) % ns;
- if (!t.Rotate(-alpha)) return 0;
+ s = (s-1+fN) % fN;
+ if (!t.Rotate(-fSectors->GetAlpha())) return 0;
}
tryAgain--;
}
}
return 1;
+}
+//_____________________________________________________________________________
+
+Int_t AliTPCtracker::FollowRefitInward(AliTPCseed *seed, AliTPCtrack *track) {
+ //
+ // This function propagates seed inward TPC using old clusters
+ // from the track.
+ //
+ // Sylwester Radomski, GSI
+ // 26.02.2003
+ //
+
+ // loop over rows
+
+ Int_t nRows = fSectors->GetNRows();
+ for (Int_t iRow = nRows; iRow >= 0; iRow--) {
+
+ Double_t x = fSectors->GetX(iRow);
+ if (!seed->PropagateTo(x)) return 0;
+
+ // try to find an assigned cluster in this row
+ AliTPCcluster* cluster = NULL;
+ Int_t idx = -1;
+ Int_t sec = -1;
+ for (Int_t iCluster = 0; iCluster < track->GetNumberOfClusters(); iCluster++) {
+ idx = track->GetClusterIndex(iCluster);
+ sec = (idx&0xff000000)>>24;
+ Int_t row = (idx&0x00ff0000)>>16;
+ if (((fSectors == fInnerSec) && (sec >= fkNIS)) ||
+ ((fSectors == fOuterSec) && (sec < fkNIS))) continue;
+ if (row == iRow) {
+ cluster = (AliTPCcluster*) GetCluster(idx);
+ break;
+ }
+ }
+
+ // update the track seed with the found cluster
+
+ if (cluster) {
+ Double_t dAlpha = fParam->GetAngle(sec) - seed->GetAlpha();
+ if (TMath::Abs(dAlpha) > 0.0001) {
+ if (!seed->Rotate(dAlpha)) return 0;
+ if (!seed->PropagateTo(x)) return 0;
+ }
+
+ seed->Update(cluster, seed->GetPredictedChi2(cluster), idx);
+ }
+ }
+
+ return 1;
}
//_____________________________________________________________________________
-void
-AliTPCtracker::MakeSeeds(TObjArray& seeds,const AliTPCSector *sec, Int_t max,
-Int_t i1, Int_t i2)
-{
+Int_t AliTPCtracker::FollowBackProlongation
+(AliTPCseed& seed, const AliTPCtrack &track) {
+ //-----------------------------------------------------------------
+ // This function propagates tracks back through the TPC
+ //-----------------------------------------------------------------
+ Double_t alpha=seed.GetAlpha() - fSectors->GetAlphaShift();
+ if (alpha > 2.*TMath::Pi()) alpha -= 2.*TMath::Pi();
+ if (alpha < 0. ) alpha += 2.*TMath::Pi();
+ Int_t s=Int_t(alpha/fSectors->GetAlpha())%fN;
+
+ Int_t idx=-1, sec=-1, row=-1;
+ Int_t nc=seed.GetNumber();
+
+ if (nc--) {
+ idx=track.GetClusterIndex(nc);
+ sec=(idx&0xff000000)>>24; row=(idx&0x00ff0000)>>16;
+ }
+ if (fSectors==fInnerSec) { if (sec >= fkNIS) row=-1; }
+ else { if (sec < fkNIS) row=-1; }
+
+ Int_t nr=fSectors->GetNRows();
+ for (Int_t i=0; i<nr; i++) {
+ Double_t x=fSectors->GetX(i), ymax=fSectors->GetMaxY(i);
+ Double_t y=seed.GetYat(x);
+
+ if (y > ymax) {
+ s = (s+1) % fN;
+ if (!seed.Rotate(fSectors->GetAlpha())) return 0;
+ } else if (y <-ymax) {
+ s = (s-1+fN) % fN;
+ if (!seed.Rotate(-fSectors->GetAlpha())) return 0;
+ }
+
+ if (!seed.PropagateTo(x)) return 0;
+
+ AliTPCcluster *cl=0;
+ Int_t index=0;
+ Double_t maxchi2=kMaxCHI2;
+ Double_t pt=seed.GetConvConst()/(100/0.299792458/0.2)/seed.Get1Pt();
+ Double_t sy2=SigmaY2(seed.GetX(),seed.GetTgl(),pt);
+ Double_t sz2=SigmaZ2(seed.GetX(),seed.GetTgl());
+ Double_t road=4.*sqrt(seed.GetSigmaY2() + sy2), z=seed.GetZ();
+ if (road>kMaxROAD) {
+ Warning("FollowBackProlongation","Too broad road !");
+ return 0;
+ }
+
+ Int_t accepted=seed.GetNumberOfClusters();
+ if (row==i) {
+ //try to accept already found cluster
+ AliTPCcluster *c=(AliTPCcluster*)GetCluster(idx);
+ Double_t chi2;
+ if ((chi2=seed.GetPredictedChi2(c))<maxchi2 || accepted<27) {
+ index=idx; cl=c; maxchi2=chi2;
+ } //else cerr<<"AliTPCtracker::FollowBackProlongation: oulier !\n";
+
+ if (nc--) {
+ idx=track.GetClusterIndex(nc);
+ sec=(idx&0xff000000)>>24; row=(idx&0x00ff0000)>>16;
+ }
+ if (fSectors==fInnerSec) { if (sec >= fkNIS) row=-1; }
+ else { if (sec < fkNIS) row=-1; }
+
+ }
+ if (!cl) {
+ //try to fill the gap
+ const AliTPCRow &krow=fSectors[s][i];
+ if (accepted>27)
+ if (krow) {
+ for (Int_t i=krow.Find(y-road); i<krow; i++) {
+ AliTPCcluster *c=(AliTPCcluster*)(krow[i]);
+ if (c->GetY() > y+road) break;
+ if (c->IsUsed()) continue;
+ if ((c->GetZ()-z)*(c->GetZ()-z)>16.*(seed.GetSigmaZ2()+sz2)) continue;
+ Double_t chi2=seed.GetPredictedChi2(c);
+ if (chi2 > maxchi2) continue;
+ maxchi2=chi2;
+ cl=c;
+ index=krow.GetIndex(i);
+ }
+ }
+ }
+
+ if (cl) {
+ Float_t l=fSectors->GetPadPitchWidth();
+ Float_t corr=1.; if (i>63) corr=0.67; // new (third) pad response !
+ seed.SetSampledEdx(cl->GetQ()/l*corr,seed.GetNumberOfClusters());
+ seed.Update(cl,maxchi2,index);
+ }
+
+ }
+
+ seed.SetNumber(nc);
+
+ return 1;
+}
+
+//_____________________________________________________________________________
+void AliTPCtracker::MakeSeeds(Int_t i1, Int_t i2) {
//-----------------------------------------------------------------
// This function creates track seeds.
//-----------------------------------------------------------------
Double_t x[5], c[15];
- Double_t alpha=sec->GetAlpha(), shift=sec->GetAlphaShift();
+ Double_t alpha=fSectors->GetAlpha(), shift=fSectors->GetAlphaShift();
Double_t cs=cos(alpha), sn=sin(alpha);
- Double_t x1 =sec->GetX(i1);
- Double_t xx2=sec->GetX(i2);
+ Double_t x1 =fSectors->GetX(i1);
+ Double_t xx2=fSectors->GetX(i2);
- for (Int_t ns=0; ns<max; ns++) {
- Int_t nl=sec[(ns-1+max)%max][i2];
- Int_t nm=sec[ns][i2];
- Int_t nu=sec[(ns+1)%max][i2];
- const AliTPCRow& kr1=sec[ns][i1];
+ for (Int_t ns=0; ns<fN; ns++) {
+ Int_t nl=fSectors[(ns-1+fN)%fN][i2];
+ Int_t nm=fSectors[ns][i2];
+ Int_t nu=fSectors[(ns+1)%fN][i2];
+ const AliTPCRow& kr1=fSectors[ns][i1];
for (Int_t is=0; is < kr1; is++) {
Double_t y1=kr1[is]->GetY(), z1=kr1[is]->GetZ();
for (Int_t js=0; js < nl+nm+nu; js++) {
const AliTPCcluster *kcl;
Double_t x2, y2, z2;
- Double_t x3=0.,y3=0.;
+ Double_t x3=GetX(), y3=GetY(), z3=GetZ();
if (js<nl) {
- const AliTPCRow& kr2=sec[(ns-1+max)%max][i2];
+ const AliTPCRow& kr2=fSectors[(ns-1+fN)%fN][i2];
kcl=kr2[js];
y2=kcl->GetY(); z2=kcl->GetZ();
x2= xx2*cs+y2*sn;
y2=-xx2*sn+y2*cs;
} else
if (js<nl+nm) {
- const AliTPCRow& kr2=sec[ns][i2];
+ const AliTPCRow& kr2=fSectors[ns][i2];
kcl=kr2[js-nl];
x2=xx2; y2=kcl->GetY(); z2=kcl->GetZ();
} else {
- const AliTPCRow& kr2=sec[(ns+1)%max][i2];
+ const AliTPCRow& kr2=fSectors[(ns+1)%fN][i2];
kcl=kr2[js-nl-nm];
y2=kcl->GetY(); z2=kcl->GetZ();
x2=xx2*cs-y2*sn;
y2=xx2*sn+y2*cs;
}
- Double_t zz=z1 - z1/x1*(x1-x2);
+ Double_t zz=z1 - (z1-z3)/(x1-x3)*(x1-x2);
if (TMath::Abs(zz-z2)>5.) continue;
Double_t d=(x2-x1)*(0.-y2)-(0.-x2)*(y2-y1);
- if (d==0.) {cerr<<"MakeSeeds warning: Straight seed !\n"; continue;}
-
+ if (d==0.) {
+ Warning("MakeSeeds","Straight seed !");
+ continue;
+ }
x[0]=y1;
x[1]=z1;
- x[3]=f1(x1,y1,x2,y2,x3,y3);
- if (TMath::Abs(x[3]) >= 0.0066) continue;
+ x[4]=f1(x1,y1,x2,y2,x3,y3);
+ if (TMath::Abs(x[4]) >= 0.0066) continue;
x[2]=f2(x1,y1,x2,y2,x3,y3);
- //if (TMath::Abs(x[3]*x1-x[2]) >= 0.99999) continue;
- x[4]=f3(x1,y1,x2,y2,z1,z2);
- if (TMath::Abs(x[4]) > 1.2) continue;
+ //if (TMath::Abs(x[4]*x1-x[2]) >= 0.99999) continue;
+ x[3]=f3(x1,y1,x2,y2,z1,z2);
+ if (TMath::Abs(x[3]) > 1.2) continue;
Double_t a=asin(x[2]);
- Double_t zv=z1 - x[4]/x[3]*(a+asin(x[3]*x1-x[2]));
- if (TMath::Abs(zv)>10.) continue;
+ Double_t zv=z1 - x[3]/x[4]*(a+asin(x[4]*x1-x[2]));
+ if (TMath::Abs(zv-z3)>10.) continue;
Double_t sy1=kr1[is]->GetSigmaY2(), sz1=kr1[is]->GetSigmaZ2();
Double_t sy2=kcl->GetSigmaY2(), sz2=kcl->GetSigmaZ2();
- Double_t sy3=100*0.025, sy=0.1, sz=0.1;
+ //Double_t sy3=400*3./12., sy=0.1, sz=0.1;
+ Double_t sy3=25000*x[4]*x[4]+0.1, sy=0.1, sz=0.1;
- Double_t f30=(f1(x1,y1+sy,x2,y2,x3,y3)-x[3])/sy;
- Double_t f32=(f1(x1,y1,x2,y2+sy,x3,y3)-x[3])/sy;
- Double_t f34=(f1(x1,y1,x2,y2,x3,y3+sy)-x[3])/sy;
+ Double_t f40=(f1(x1,y1+sy,x2,y2,x3,y3)-x[4])/sy;
+ Double_t f42=(f1(x1,y1,x2,y2+sy,x3,y3)-x[4])/sy;
+ Double_t f43=(f1(x1,y1,x2,y2,x3,y3+sy)-x[4])/sy;
Double_t f20=(f2(x1,y1+sy,x2,y2,x3,y3)-x[2])/sy;
Double_t f22=(f2(x1,y1,x2,y2+sy,x3,y3)-x[2])/sy;
- Double_t f24=(f2(x1,y1,x2,y2,x3,y3+sy)-x[2])/sy;
- Double_t f40=(f3(x1,y1+sy,x2,y2,z1,z2)-x[4])/sy;
- Double_t f41=(f3(x1,y1,x2,y2,z1+sz,z2)-x[4])/sz;
- Double_t f42=(f3(x1,y1,x2,y2+sy,z1,z2)-x[4])/sy;
- Double_t f43=(f3(x1,y1,x2,y2,z1,z2+sz)-x[4])/sz;
+ Double_t f23=(f2(x1,y1,x2,y2,x3,y3+sy)-x[2])/sy;
+ Double_t f30=(f3(x1,y1+sy,x2,y2,z1,z2)-x[3])/sy;
+ Double_t f31=(f3(x1,y1,x2,y2,z1+sz,z2)-x[3])/sz;
+ Double_t f32=(f3(x1,y1,x2,y2+sy,z1,z2)-x[3])/sy;
+ Double_t f34=(f3(x1,y1,x2,y2,z1,z2+sz)-x[3])/sz;
c[0]=sy1;
c[1]=0.; c[2]=sz1;
- c[3]=f20*sy1; c[4]=0.; c[5]=f20*sy1*f20+f22*sy2*f22+f24*sy3*f24;
- c[6]=f30*sy1; c[7]=0.; c[8]=f30*sy1*f20+f32*sy2*f22+f34*sy3*f24;
- c[9]=f30*sy1*f30+f32*sy2*f32+f34*sy3*f34;
- c[10]=f40*sy1; c[11]=f41*sz1; c[12]=f40*sy1*f20+f42*sy2*f22;
- c[13]=f40*sy1*f30+f42*sy2*f32;
- c[14]=f40*sy1*f40+f41*sz1*f41+f42*sy2*f42+f43*sz2*f43;
+ c[3]=f20*sy1; c[4]=0.; c[5]=f20*sy1*f20+f22*sy2*f22+f23*sy3*f23;
+ c[6]=f30*sy1; c[7]=f31*sz1; c[8]=f30*sy1*f20+f32*sy2*f22;
+ c[9]=f30*sy1*f30+f31*sz1*f31+f32*sy2*f32+f34*sz2*f34;
+ c[10]=f40*sy1; c[11]=0.; c[12]=f40*sy1*f20+f42*sy2*f22+f43*sy3*f23;
+ c[13]=f30*sy1*f40+f32*sy2*f42;
+ c[14]=f40*sy1*f40+f42*sy2*f42+f43*sy3*f43;
UInt_t index=kr1.GetIndex(is);
AliTPCseed *track=new AliTPCseed(index, x, c, x1, ns*alpha+shift);
- Float_t l=sec->GetPadPitchWidth();
+ Float_t l=fSectors->GetPadPitchWidth();
track->SetSampledEdx(kr1[is]->GetQ()/l,0);
- Int_t rc=FindProlongation(*track,sec,ns,i2);
- if (rc<0 || track->GetNumberOfClusters()<(i1-i2)/2) delete track;
- else seeds.AddLast(track);
+ Int_t rc=FollowProlongation(*track, i2);
+ if (rc==0 || track->GetNumberOfClusters()<(i1-i2)/2) delete track;
+ else fSeeds->AddLast(track);
}
}
}
}
//_____________________________________________________________________________
-Int_t AliTPCtracker::Clusters2Tracks(const AliTPCParam *par, TFile *of) {
+Int_t AliTPCtracker::ReadSeeds(const TFile *inp) {
//-----------------------------------------------------------------
- // This is a track finder.
+ // This function reades track seeds.
//-----------------------------------------------------------------
TDirectory *savedir=gDirectory;
- if (!of->IsOpen()) {
- cerr<<"AliTPCtracker::Clusters2Tracks(): output file not open !\n";
+ TFile *in=(TFile*)inp;
+ if (!in->IsOpen()) {
+ Error("ReadSeeds","Input file has not been open !");
return 1;
}
- AliTPCClustersArray carray;
- carray.Setup(par);
- carray.SetClusterType("AliTPCcluster");
- carray.ConnectTree("Segment Tree");
+ in->cd();
+ TTree *seedTree=(TTree*)in->Get("Seeds");
+ if (!seedTree) {
+ Error("ReadSeeds","Can't get a tree with track seeds !");
+ return 2;
+ }
+ AliTPCtrack *seed=new AliTPCtrack;
+ seedTree->SetBranchAddress("tracks",&seed);
+
+ if (fSeeds==0) fSeeds=new TObjArray(15000);
- of->cd();
- TTree tracktree("TreeT","Tree with TPC tracks");
- AliTPCtrack *iotrack=0;
- tracktree.Branch("tracks","AliTPCtrack",&iotrack,32000,0);
+ Int_t n=(Int_t)seedTree->GetEntries();
+ for (Int_t i=0; i<n; i++) {
+ seedTree->GetEvent(i);
+ fSeeds->AddLast(new AliTPCseed(*seed,seed->GetAlpha()));
+ }
+
+ delete seed;
- AliTPCSector::SetParam(par);
+ delete seedTree; //Thanks to Mariana Bondila
- const Int_t kNIS=par->GetNInnerSector()/2;
- AliTPCSSector *ssec=new AliTPCSSector[kNIS];
- Int_t nlow=ssec->GetNRows();
+ savedir->cd();
- const Int_t kNOS=par->GetNOuterSector()/2;
- AliTPCLSector *lsec=new AliTPCLSector[kNOS];
- Int_t nup=lsec->GetNRows();
-
- //Load outer sectors
- UInt_t index;
- Int_t i,j;
-
- j=Int_t(carray.GetTree()->GetEntries());
- for (i=0; i<j; i++) {
- AliSegmentID *s=carray.LoadEntry(i);
- Int_t sec,row;
- par->AdjustSectorRow(s->GetID(),sec,row);
- if (sec<kNIS*2) continue;
- AliTPCClustersRow *clrow=carray.GetRow(sec,row);
- Int_t ncl=clrow->GetArray()->GetEntriesFast();
- while (ncl--) {
- AliTPCcluster *c=(AliTPCcluster*)(*clrow)[ncl];
- index=(((sec<<8)+row)<<16)+ncl;
- lsec[(sec-kNIS*2)%kNOS][row].InsertCluster(c,index);
+ return 0;
+}
+
+//_____________________________________________________________________________
+Int_t AliTPCtracker::Clusters2Tracks(AliESD *event) {
+ //-----------------------------------------------------------------
+ // This is a track finder.
+ // The clusters must be already loaded !
+ //-----------------------------------------------------------------
+
+ //find track seeds
+ Int_t nup=fOuterSec->GetNRows(), nlow=fInnerSec->GetNRows();
+ Int_t nrows=nlow+nup;
+ if (fSeeds==0) {
+ Int_t gap=Int_t(0.125*nrows), shift=Int_t(0.5*gap);
+ fSectors=fOuterSec; fN=fkNOS;
+ fSeeds=new TObjArray(15000);
+ MakeSeeds(nup-1, nup-1-gap);
+ MakeSeeds(nup-1-shift, nup-1-shift-gap);
+ }
+ fSeeds->Sort();
+
+ Int_t nseed=fSeeds->GetEntriesFast();
+ for (Int_t i=0; i<nseed; i++) {
+ //tracking in the outer sectors
+ fSectors=fOuterSec; fN=fkNOS;
+
+ AliTPCseed *pt=(AliTPCseed*)fSeeds->UncheckedAt(i), &t=*pt;
+ if (!FollowProlongation(t)) {
+ delete fSeeds->RemoveAt(i);
+ continue;
+ }
+
+ //tracking in the inner sectors
+ fSectors=fInnerSec; fN=fkNIS;
+
+ Double_t alpha=t.GetAlpha() - fInnerSec->GetAlphaShift();
+ if (alpha > 2.*TMath::Pi()) alpha -= 2.*TMath::Pi();
+ if (alpha < 0. ) alpha += 2.*TMath::Pi();
+ Int_t ns=Int_t(alpha/fInnerSec->GetAlpha())%fkNIS;
+
+ alpha=ns*fInnerSec->GetAlpha()+fInnerSec->GetAlphaShift()-t.GetAlpha();
+
+ if (t.Rotate(alpha)) {
+ if (FollowProlongation(t)) {
+ if (t.GetNumberOfClusters() >= Int_t(0.4*nrows)) {
+ t.CookdEdx();
+ CookLabel(pt,0.1); //For comparison only
+ pt->PropagateTo(fParam->GetInnerRadiusLow());
+ AliESDtrack iotrack;
+ iotrack.UpdateTrackParams(pt,AliESDtrack::kTPCin);
+
+ event->AddTrack(&iotrack);
+
+ UseClusters(&t);
+ }
}
+ }
+ delete fSeeds->RemoveAt(i);
}
+ Info("Clusters2Tracks","Number of found tracks : %d",
+ event->GetNumberOfTracks());
+
+ fSeeds->Clear(); delete fSeeds; fSeeds=0;
+
+ return 0;
+}
+
+//_____________________________________________________________________________
+Int_t AliTPCtracker::Clusters2Tracks(TTree *cTree, TTree *tTree) {
+ //-----------------------------------------------------------------
+ // This is a track finder.
+ //-----------------------------------------------------------------
+ if (LoadClusters(cTree)) {
+ Error("Clusters2Tracks","Problem with loading the clusters...");
+ return 1;
+ }
+
+ AliTPCtrack *iotrack=0;
+ TBranch *branch=tTree->GetBranch("tracks");
+ if (!branch) tTree->Branch("tracks","AliTPCtrack",&iotrack,32000,3);
+ else branch->SetAddress(&iotrack);
+
//find track seeds
- TObjArray seeds(20000);
+ Int_t nup=fOuterSec->GetNRows(), nlow=fInnerSec->GetNRows();
Int_t nrows=nlow+nup;
- Int_t gap=Int_t(0.125*nrows), shift=Int_t(0.5*gap);
- MakeSeeds(seeds, lsec, kNOS, nup-1, nup-1-gap);
- MakeSeeds(seeds, lsec, kNOS, nup-1-shift, nup-1-shift-gap);
- seeds.Sort();
+ if (fSeeds==0) {
+ Int_t gap=Int_t(0.125*nrows), shift=Int_t(0.5*gap);
+ fSectors=fOuterSec; fN=fkNOS;
+ fSeeds=new TObjArray(15000);
+ MakeSeeds(nup-1, nup-1-gap);
+ MakeSeeds(nup-1-shift, nup-1-shift-gap);
+ }
+ fSeeds->Sort();
- //tracking in outer sectors
- Int_t nseed=seeds.GetEntriesFast();
- for (i=0; i<nseed; i++) {
- AliTPCseed *pt=(AliTPCseed*)seeds.UncheckedAt(i), &t=*pt;
- Double_t alpha=t.GetAlpha();
- if (alpha > 2.*TMath::Pi()) alpha -= 2.*TMath::Pi();
- if (alpha < 0. ) alpha += 2.*TMath::Pi();
- Int_t ns=Int_t(alpha/lsec->GetAlpha())%kNOS;
-
- if (FindProlongation(t,lsec,ns)) {
- t.UseClusters(&carray);
+ Int_t found=0;
+ Int_t nseed=fSeeds->GetEntriesFast();
+
+ for (Int_t i=0; i<nseed; i++) {
+ //tracking in the outer sectors
+ fSectors=fOuterSec; fN=fkNOS;
+
+ AliTPCseed *pt=(AliTPCseed*)fSeeds->UncheckedAt(i), &t=*pt;
+ if (!FollowProlongation(t)) {
+ delete fSeeds->RemoveAt(i);
continue;
}
- delete seeds.RemoveAt(i);
- }
- //unload outer sectors
- for (i=0; i<kNOS; i++) {
- for (j=0; j<nup; j++) {
- if (carray.GetRow(i+kNIS*2,j)) carray.ClearRow(i+kNIS*2,j);
- if (carray.GetRow(i+kNIS*2+kNOS,j)) carray.ClearRow(i+kNIS*2+kNOS,j);
+ //tracking in the inner sectors
+ fSectors=fInnerSec; fN=fkNIS;
+
+ Double_t alpha=t.GetAlpha() - fInnerSec->GetAlphaShift();
+ if (alpha > 2.*TMath::Pi()) alpha -= 2.*TMath::Pi();
+ if (alpha < 0. ) alpha += 2.*TMath::Pi();
+ Int_t ns=Int_t(alpha/fInnerSec->GetAlpha())%fkNIS;
+
+ alpha=ns*fInnerSec->GetAlpha()+fInnerSec->GetAlphaShift()-t.GetAlpha();
+
+ if (t.Rotate(alpha)) {
+ if (FollowProlongation(t)) {
+ if (t.GetNumberOfClusters() >= Int_t(0.4*nrows)) {
+ t.CookdEdx();
+ CookLabel(pt,0.1); //For comparison only
+ pt->PropagateTo(fParam->GetInnerRadiusLow());
+ iotrack=pt;
+ tTree->Fill();
+ UseClusters(&t);
+ found++;
+ }
}
+ }
+ delete fSeeds->RemoveAt(i);
}
+
+ Info("Clusters2Tracks","Number of found tracks : %d",found);
+
+ UnloadClusters();
+
+ fSeeds->Clear(); delete fSeeds; fSeeds=0;
+
+ return 0;
+}
+
+//_____________________________________________________________________________
+Int_t AliTPCtracker::RefitInward(AliESD* event) {
+ //
+ // The function propagates tracks throught TPC inward
+ // using already associated clusters.
+ // The clusters must be already loaded !
+ //
+
+ Int_t nTracks = event->GetNumberOfTracks();
+ Int_t nRefited = 0;
+
+ for (Int_t i = 0; i < nTracks; i++) {
+ AliESDtrack* track = event->GetTrack(i);
+ ULong_t status = track->GetStatus();
+
+ if ( (status & AliESDtrack::kTPCout ) == 0 ) continue;
+ if ( (status & AliESDtrack::kTPCrefit) != 0 ) continue;
+
+ AliTPCtrack* tpcTrack = new AliTPCtrack(*track);
+ AliTPCseed* seed = new AliTPCseed(*tpcTrack, tpcTrack->GetAlpha());
+
+ fSectors = fOuterSec;
+
+ Int_t res = FollowRefitInward(seed, tpcTrack);
+ UseClusters(seed);
+ Int_t nc = seed->GetNumberOfClusters();
+
+ fSectors = fInnerSec;
+
+ res = FollowRefitInward(seed, tpcTrack);
+ UseClusters(seed, nc);
+
+ if (res) {
+ seed->PropagateTo(fParam->GetInnerRadiusLow());
+ seed->SetLabel(tpcTrack->GetLabel());
+ seed->SetdEdx(tpcTrack->GetdEdx());
+ track->UpdateTrackParams(seed, AliESDtrack::kTPCrefit);
+ nRefited++;
+ }
+
+ delete seed;
+ delete tpcTrack;
+ }
+
+ Info("RefitInward","Number of refitted tracks : %d",nRefited);
+
+ return 0;
+}
+
+//_____________________________________________________________________________
+Int_t AliTPCtracker::RefitInward(TTree */*in*/, TTree */*out*/) {
+ //
+ // The function propagates tracks throught TPC inward
+ // using already associated clusters.
+ //
+ Error("RefitInward","This method is not converted to NewIO yet\n");
+ return 1;
+ /*
+ if (!inSeeds->IsOpen()) {
+ cout << "Input File with seeds not open !\n" << endl;
+ return 1;
+ }
+
+ if (!inTracks->IsOpen()) {
+ cout << "Input File not open !\n" << endl;
+ return 2;
+ }
+
+ if (!outTracks->IsOpen()) {
+ cout << "Output File not open !\n" << endl;
+ return 3;
+ }
+
+ TDirectory *savedir = gDirectory;
+ LoadClusters();
+
+ // Connect to input seeds tree
+ inSeeds->cd();
+ char tname[100];
+ sprintf(tname, "seedTRDtoTPC_%d", GetEventNumber());
+ TTree *seedsTree = (TTree*)inSeeds->Get(tname);
+ TBranch *inSeedBranch = seedsTree->GetBranch("tracks");
+ AliTPCtrack *inSeedTrack = 0;
+ inSeedBranch->SetAddress(&inSeedTrack);
+
+ Int_t nSeeds = (Int_t)seedsTree->GetEntries();
+
+ // Connect to input tree
+ inTracks->cd();
+ sprintf(tname,"TreeT_TPC_%d",GetEventNumber());
+// sprintf(tname,"seedsTPCtoTRD_%d",GetEventNumber());
+ TTree *inputTree = (TTree*)inTracks->Get(tname);
+ TBranch *inBranch = inputTree->GetBranch("tracks");
+ AliTPCtrack *inTrack = 0;
+ inBranch->SetAddress(&inTrack);
+
+ Int_t nTracks = (Int_t)inputTree->GetEntries();
+
+ // Create output tree
+ outTracks->cd();
+ AliTPCtrack *outTrack = new AliTPCtrack();
+ sprintf(tname, "tracksTPC_%d", GetEventNumber());
+ TTree *outputTree = new TTree(tname,"Refited TPC tracks");
+ outputTree->Branch("tracks", "AliTPCtrack", &outTrack, 32000, 3);
- //load inner sectors
- j=Int_t(carray.GetTree()->GetEntries());
- for (i=0; i<j; i++) {
- AliSegmentID *s=carray.LoadEntry(i);
- Int_t sec,row;
- par->AdjustSectorRow(s->GetID(),sec,row);
- if (sec>=kNIS*2) continue;
- AliTPCClustersRow *clrow=carray.GetRow(sec,row);
- Int_t ncl=clrow->GetArray()->GetEntriesFast();
- while (ncl--) {
- AliTPCcluster *c=(AliTPCcluster*)(*clrow)[ncl];
- index=(((sec<<8)+row)<<16)+ncl;
- ssec[sec%kNIS][row].InsertCluster(c,index);
+ Int_t nRefited = 0;
+
+ // create table of track labels
+ Int_t* inLab = new Int_t[nTracks];
+ for (Int_t i = 0; i < nTracks; i++) inLab[i] = -1;
+
+ // [SR, 01.04.2003] - Barrel tracks
+ if (IsStoringBarrel()) SetBarrelTree("refit");
+
+ for(Int_t t=0; t < nSeeds; t++) {
+
+ seedsTree->GetEntry(t);
+ // find TPC track for seed
+ Int_t lab = TMath::Abs(inSeedTrack->GetLabel());
+ for(Int_t i=0; i < nTracks; i++) {
+ if (inLab[i] == lab) {
+ inputTree->GetEntry(i);
+ break;
+ } else if (inLab[i] < 0) {
+ inputTree->GetEntry(i);
+ inLab[i] = TMath::Abs(inTrack->GetLabel());
+ if (inLab[i] == lab) break;
}
+ }
+ if (TMath::Abs(inTrack->GetLabel()) != lab) continue;
+ AliTPCseed *seed = new AliTPCseed(*inSeedTrack, inTrack->GetAlpha());
+ if (IsStoringBarrel()) StoreBarrelTrack(seed, 4, 2);
+
+ fSectors = fOuterSec;
+
+ Int_t res = FollowRefitInward(seed, inTrack);
+ UseClusters(seed);
+ Int_t nc = seed->GetNumberOfClusters();
+
+ if (IsStoringBarrel()) StoreBarrelTrack(seed, 3, 2);
+ if (IsStoringBarrel()) StoreBarrelTrack(seed, 2, 2);
+
+ fSectors = fInnerSec;
+
+ res = FollowRefitInward(seed, inTrack);
+ UseClusters(seed, nc);
+
+ if (IsStoringBarrel()) StoreBarrelTrack(seed, 1, 2);
+
+ if (res) {
+ seed->PropagateTo(fParam->GetInnerRadiusLow());
+ outTrack = (AliTPCtrack*)seed;
+ outTrack->SetLabel(inTrack->GetLabel());
+ outTrack->SetdEdx(inTrack->GetdEdx());
+ outputTree->Fill();
+ nRefited++;
+ }
+
+ if (IsStoringBarrel()) fBarrelTree->Fill();
+ delete seed;
}
- //tracking in inner sectors
- Int_t found=0;
- for (i=0; i<nseed; i++) {
- AliTPCseed *pt=(AliTPCseed*)seeds.UncheckedAt(i), &t=*pt;
- if (!pt) continue;
+ cout << "Refitted " << nRefited << " tracks." << endl;
+
+ outTracks->cd();
+ outputTree->Write();
+
+ delete[] inLab;
+
+ // [SR, 01.04.2003]
+ if (IsStoringBarrel()) {
+ fBarrelFile->cd();
+ fBarrelTree->Write();
+ fBarrelFile->Flush();
+
+ delete fBarrelArray;
+ delete fBarrelTree;
+ }
+
+ if (inputTree) delete inputTree;
+ if (outputTree) delete outputTree;
+
+ savedir->cd();
+ UnloadClusters();
+
+ return 0;
+ */
+}
+
+Int_t AliTPCtracker::PropagateBack(AliESD *event) {
+ //-----------------------------------------------------------------
+ // This function propagates tracks back through the TPC.
+ // The clusters must be already loaded !
+ //-----------------------------------------------------------------
+ Int_t nentr=event->GetNumberOfTracks();
+ Info("PropagateBack", "Number of ESD tracks: %d\n", nentr);
+
+ Int_t ntrk=0;
+ for (Int_t i=0; i<nentr; i++) {
+ AliESDtrack *esd=event->GetTrack(i);
+ ULong_t status=esd->GetStatus();
+
+ if ( (status & AliESDtrack::kTPCin ) == 0 ) continue;
+ if ( (status & AliESDtrack::kTPCout) != 0 ) continue;
+
+ const AliTPCtrack t(*esd);
+ AliTPCseed s(t,t.GetAlpha());
+
+ if ( (status & AliESDtrack::kITSout) == 0 ) s.ResetCovariance();
+
+ s.ResetNWrong();
+ s.ResetNRotation();
+
Int_t nc=t.GetNumberOfClusters();
+ s.SetNumber(nc); //set number of the cluster to start with
+
+ //inner sectors
+ fSectors=fInnerSec; fN=fkNIS;
- Double_t alpha=t.GetAlpha() - ssec->GetAlphaShift();
+ Double_t alpha=s.GetAlpha() - fSectors->GetAlphaShift();
if (alpha > 2.*TMath::Pi()) alpha -= 2.*TMath::Pi();
if (alpha < 0. ) alpha += 2.*TMath::Pi();
- Int_t ns=Int_t(alpha/ssec->GetAlpha())%kNIS;
+ Int_t ns=Int_t(alpha/fSectors->GetAlpha())%fN;
+ alpha =ns*fSectors->GetAlpha() + fSectors->GetAlphaShift();
+ alpha-=s.GetAlpha();
- alpha=ns*ssec->GetAlpha() + ssec->GetAlphaShift() - t.GetAlpha();
+ if (!s.Rotate(alpha)) continue;
+ if (!FollowBackProlongation(s,t)) continue;
- if (t.Rotate(alpha)) {
- if (FindProlongation(t,ssec,ns)) {
- if (t.GetNumberOfClusters() >= Int_t(0.4*nrows)) {
- t.CookdEdx();
- //t.CookLabel(&carray);
- iotrack=pt;
- tracktree.Fill();
- t.UseClusters(&carray,nc);
- cerr<<found++<<'\r';
- }
- }
+ UseClusters(&s);
+
+ //outer sectors
+ fSectors=fOuterSec; fN=fkNOS;
+
+ nc=s.GetNumberOfClusters();
+
+ alpha=s.GetAlpha() - fSectors->GetAlphaShift();
+ if (alpha > 2.*TMath::Pi()) alpha -= 2.*TMath::Pi();
+ if (alpha < 0. ) alpha += 2.*TMath::Pi();
+ ns=Int_t(alpha/fSectors->GetAlpha())%fN;
+
+ alpha =ns*fSectors->GetAlpha() + fSectors->GetAlphaShift();
+ alpha-=s.GetAlpha();
+
+ if (!s.Rotate(alpha)) continue;
+ if (!FollowBackProlongation(s,t)) continue;
+ {
+ Int_t nrows=fOuterSec->GetNRows()+fInnerSec->GetNRows();
+ if (s.GetNumberOfClusters() < Int_t(0.4*nrows)) continue;
}
- delete seeds.RemoveAt(i);
- }
- tracktree.Write();
+ s.PropagateTo(fParam->GetOuterRadiusUp());
+ s.CookdEdx();
+ CookLabel(&s,0.1); //For comparison only
+ UseClusters(&s,nc);
+ esd->UpdateTrackParams(&s,AliESDtrack::kTPCout);
+ ntrk++;
+ }
+ Info("PropagateBack","Number of back propagated tracks: %d",ntrk);
+
+ return 0;
+}
+
+//_____________________________________________________________________________
+Int_t AliTPCtracker::PropagateBack(TTree */*in*/, TTree */*out*/) {
+ //-----------------------------------------------------------------
+ // This function propagates tracks back through the TPC.
+ //-----------------------------------------------------------------
+ Error("PropagateBack","This method is not converted to NewIO yet\n");
+ return 1;
+ /*
+ fSeeds=new TObjArray(15000);
+
+ TFile *in=(TFile*)inp;
+ TFile *in2=(TFile*)inp2;
+ TDirectory *savedir=gDirectory;
+
+ if (!in->IsOpen()) {
+ cerr<<"AliTPCtracker::PropagateBack(): ";
+ cerr<<"file with TPC (or back propagated ITS) tracks is not open !\n";
+ return 1;
+ }
+
+ if (!out->IsOpen()) {
+ cerr<<"AliTPCtracker::PropagateBack(): ";
+ cerr<<"file for back propagated TPC tracks is not open !\n";
+ return 2;
+ }
+
+ LoadClusters();
+
+ in->cd();
+ char tName[100];
+ sprintf(tName,"TreeT_ITSb_%d",GetEventNumber());
+ TTree *bckTree=(TTree*)in->Get(tName);
+ if (!bckTree && inp2) bckTree=(TTree*)in2->Get(tName);
+ if (!bckTree) {
+ cerr<<"AliTPCtracker::PropagateBack() ";
+ cerr<<"can't get a tree with back propagated ITS tracks !\n";
+ //return 3;
+ }
+ AliTPCtrack *bckTrack=new AliTPCtrack;
+ if (bckTree) bckTree->SetBranchAddress("tracks",&bckTrack);
+
+ sprintf(tName,"TreeT_TPC_%d",GetEventNumber());
+ TTree *tpcTree=(TTree*)in->Get(tName);
+ if (!tpcTree) {
+ cerr<<"AliTPCtracker::PropagateBack() ";
+ cerr<<"can't get a tree with TPC tracks !\n";
+ return 4;
+ }
+ AliTPCtrack *tpcTrack=new AliTPCtrack;
+ tpcTree->SetBranchAddress("tracks",&tpcTrack);
+
+ // [SR, 01.04.2003] - Barrel tracks
+ if (IsStoringBarrel()) SetBarrelTree("back");
+
+ // Prepare an array of tracks to be back propagated
+ Int_t nup=fOuterSec->GetNRows(), nlow=fInnerSec->GetNRows();
+ Int_t nrows=nlow+nup;
- //unload inner sectors
- for (i=0; i<kNIS; i++) {
- for (j=0; j<nlow; j++) {
- if (carray.GetRow(i,j)) carray.ClearRow(i,j);
- if (carray.GetRow(i+kNIS,j)) carray.ClearRow(i+kNIS,j);
+ //
+ // Match ITS tracks with old TPC tracks
+ // the tracks do not have to be sorted [SR, GSI, 18.02.2003]
+ //
+ // the algorithm is linear and uses LUT for sorting
+ // cost of the algorithm: 2 * number of tracks
+ //
+
+ TObjArray tracks(15000);
+ Int_t i=0;
+ Int_t tpcN= (Int_t)tpcTree->GetEntries();
+ Int_t bckN= (bckTree)? (Int_t)bckTree->GetEntries() : 0;
+
+ // look up table
+ const Int_t nLab = 200000; // limit on number of primaries (arbitrary)
+ Int_t lut[nLab];
+ for(Int_t i=0; i<nLab; i++) lut[i] = -1;
+
+ if (bckTree) {
+ for(Int_t i=0; i<bckN; i++) {
+ bckTree->GetEvent(i);
+ Int_t lab = TMath::Abs(bckTrack->GetLabel());
+ if (lab < nLab) lut[lab] = i;
+ else {
+ cerr << "AliTPCtracker: The size of the LUT is too small\n";
}
+ }
}
+
+ for (Int_t i=0; i<tpcN; i++) {
+ tpcTree->GetEvent(i);
+ Double_t alpha=tpcTrack->GetAlpha();
+
+ if (!bckTree) {
+
+ // No ITS - use TPC track only
+
+ tpcTrack->ResetCovariance();
+ AliTPCseed * seed = new AliTPCseed(*tpcTrack, tpcTrack->GetAlpha());
+
+ fSeeds->AddLast(seed);
+ tracks.AddLast(new AliTPCtrack(*tpcTrack));
+
+ } else {
+
+ // with ITS
+ // discard not prolongated tracks (to be discussed)
+
+ Int_t lab = TMath::Abs(tpcTrack->GetLabel());
+ if (lab > nLab || lut[lab] < 0) continue;
- cerr<<"Number of found tracks : "<<found<<endl;
+ bckTree->GetEvent(lut[lab]);
+ bckTrack->Rotate(alpha-bckTrack->GetAlpha());
- delete[] ssec;
- delete[] lsec;
+ fSeeds->AddLast(new AliTPCseed(*bckTrack,bckTrack->GetAlpha()));
+ tracks.AddLast(new AliTPCtrack(*tpcTrack));
+ }
+ }
+
+ // end of matching
+
+ out->cd();
+
+ // tree name seedsTPCtoTRD as expected by TRD and as
+ // discussed and decided in Strasbourg (May 2002)
+ // [SR, GSI, 18.02.2003]
+
+ sprintf(tName,"seedsTPCtoTRD_%d",GetEventNumber());
+ TTree backTree(tName,"Tree with back propagated TPC tracks");
+
+ AliTPCtrack *otrack=0;
+ backTree.Branch("tracks","AliTPCtrack",&otrack,32000,0);
+
+ //
+ Int_t nRefPlane;
+ Int_t found=0;
+ Int_t nseed=fSeeds->GetEntriesFast();
+
+ // loop changed [SR, 01.04.2003]
+
+ for (i=0; i<nseed; i++) {
+
+ nRefPlane = 1;
+ if (IsStoringBarrel()) fBarrelArray->Clear();
+
+ AliTPCseed *ps=(AliTPCseed*)fSeeds->UncheckedAt(i), &s=*ps;
+ const AliTPCtrack *pt=(AliTPCtrack*)tracks.UncheckedAt(i), &t=*pt;
+
+ ps->ResetNWrong();
+ ps->ResetNRotation();
+
+ if (IsStoringBarrel()) StoreBarrelTrack(ps, 1, 1);
+
+ // Load outer sectors
+ fSectors=fInnerSec;
+ fN=fkNIS;
+
+ Int_t nc=t.GetNumberOfClusters();
+ //s.SetLabel(nc-1); //set number of the cluster to start with
+ s.SetNumber(nc);
+
+ if (FollowBackProlongation(s,t)) UseClusters(&s);
+ else {
+ fSeeds->RemoveAt(i);
+ continue;
+ }
+
+ if (IsStoringBarrel()) StoreBarrelTrack(ps, 2, 1);
+ if (IsStoringBarrel()) StoreBarrelTrack(ps, 3, 1);
+
+ // Load outer sectors
+ fSectors=fOuterSec;
+ fN=fkNOS;
+
+ nc=s.GetNumberOfClusters();
+
+ Double_t alpha=s.GetAlpha() - fSectors->GetAlphaShift();
+ if (alpha > 2.*TMath::Pi()) alpha -= 2.*TMath::Pi();
+ if (alpha < 0. ) alpha += 2.*TMath::Pi();
+ Int_t ns=Int_t(alpha/fSectors->GetAlpha())%fN;
+
+ alpha =ns*fSectors->GetAlpha() + fSectors->GetAlphaShift();
+ alpha-=s.GetAlpha();
+
+ if (s.Rotate(alpha)) {
+ if (FollowBackProlongation(s,t)) {
+ if (s.GetNumberOfClusters() >= Int_t(0.4*nrows)) {
+ s.CookdEdx();
+ s.SetLabel(t.GetLabel());
+ UseClusters(&s,nc);
+
+ // Propagate to outer reference plane for comparison reasons
+ // reason for keeping fParam object [SR, GSI, 18.02.2003]
+
+ ps->PropagateTo(fParam->GetOuterRadiusUp());
+ otrack=ps;
+ backTree.Fill();
+
+ if (IsStoringBarrel()) StoreBarrelTrack(ps, 4, 1);
+ cerr<<found++<<'\r';
+ }
+ }
+ }
+
+ if (IsStoringBarrel()) fBarrelTree->Fill();
+ delete fSeeds->RemoveAt(i);
+ }
+
+
+ out->cd();
+ backTree.Write();
+
+ // [SR, 01.04.2003]
+ if (IsStoringBarrel()) {
+ fBarrelFile->cd();
+ fBarrelTree->Write();
+ fBarrelFile->Flush();
+
+ delete fBarrelArray;
+ delete fBarrelTree;
+ }
savedir->cd();
+ cerr<<"Number of seeds: "<<nseed<<endl;
+ cerr<<"Number of back propagated ITS tracks: "<<bckN<<endl;
+ cerr<<"Number of back propagated TPC tracks: "<<found<<endl;
+
+ delete bckTrack;
+ delete tpcTrack;
+
+ if (bckTree) delete bckTree; //Thanks to Mariana Bondila
+ delete tpcTree; //Thanks to Mariana Bondila
+
+ UnloadClusters();
return 0;
+ */
+}
+
+//_________________________________________________________________________
+AliCluster *AliTPCtracker::GetCluster(Int_t index) const {
+ //--------------------------------------------------------------------
+ // Return pointer to a given cluster
+ //--------------------------------------------------------------------
+ Int_t sec=(index&0xff000000)>>24;
+ Int_t row=(index&0x00ff0000)>>16;
+ Int_t ncl=(index&0x0000ffff)>>00;
+
+ const AliTPCcluster *cl=0;
+
+ if (sec<fkNIS) {
+ cl=fInnerSec[sec][row].GetUnsortedCluster(ncl);
+ } else {
+ sec-=fkNIS;
+ cl=fOuterSec[sec][row].GetUnsortedCluster(ncl);
+ }
+
+ return (AliCluster*)cl;
+}
+
+//__________________________________________________________________________
+void AliTPCtracker::CookLabel(AliKalmanTrack *t, Float_t wrong) const {
+ //--------------------------------------------------------------------
+ //This function "cooks" a track label. If label<0, this track is fake.
+ //--------------------------------------------------------------------
+ Int_t noc=t->GetNumberOfClusters();
+ Int_t *lb=new Int_t[noc];
+ Int_t *mx=new Int_t[noc];
+ AliCluster **clusters=new AliCluster*[noc];
+
+ Int_t i;
+ for (i=0; i<noc; i++) {
+ lb[i]=mx[i]=0;
+ Int_t index=t->GetClusterIndex(i);
+ clusters[i]=GetCluster(index);
+ }
+
+ Int_t lab=123456789;
+ for (i=0; i<noc; i++) {
+ AliCluster *c=clusters[i];
+ lab=TMath::Abs(c->GetLabel(0));
+ Int_t j;
+ for (j=0; j<noc; j++) if (lb[j]==lab || mx[j]==0) break;
+ lb[j]=lab;
+ (mx[j])++;
+ }
+
+ Int_t max=0;
+ for (i=0; i<noc; i++) if (mx[i]>max) {max=mx[i]; lab=lb[i];}
+
+ for (i=0; i<noc; i++) {
+ AliCluster *c=clusters[i];
+ if (TMath::Abs(c->GetLabel(1)) == lab ||
+ TMath::Abs(c->GetLabel(2)) == lab ) max++;
+ }
+
+ if ((1.- Float_t(max)/noc) > wrong) lab=-lab;
+
+ else {
+ Int_t tail=Int_t(0.10*noc);
+ max=0;
+ for (i=1; i<=tail; i++) {
+ AliCluster *c=clusters[noc-i];
+ if (lab == TMath::Abs(c->GetLabel(0)) ||
+ lab == TMath::Abs(c->GetLabel(1)) ||
+ lab == TMath::Abs(c->GetLabel(2))) max++;
+ }
+ if (max < Int_t(0.5*tail)) lab=-lab;
+ }
+
+ t->SetLabel(lab);
+
+ delete[] lb;
+ delete[] mx;
+ delete[] clusters;
}
//_________________________________________________________________________
-void
-AliTPCtracker::AliTPCRow::InsertCluster(const AliTPCcluster* c, UInt_t index) {
+void AliTPCtracker::AliTPCSector::Setup(const AliTPCParam *par, Int_t f) {
+ //-----------------------------------------------------------------------
+ // Setup inner sector
+ //-----------------------------------------------------------------------
+ if (f==0) {
+ fAlpha=par->GetInnerAngle();
+ fAlphaShift=par->GetInnerAngleShift();
+ fPadPitchWidth=par->GetInnerPadPitchWidth();
+ f1PadPitchLength=par->GetInnerPadPitchLength();
+ f2PadPitchLength=f1PadPitchLength;
+
+ fN=par->GetNRowLow();
+ fRow=new AliTPCRow[fN];
+ for (Int_t i=0; i<fN; i++) fRow[i].SetX(par->GetPadRowRadiiLow(i));
+ } else {
+ fAlpha=par->GetOuterAngle();
+ fAlphaShift=par->GetOuterAngleShift();
+ fPadPitchWidth=par->GetOuterPadPitchWidth();
+ f1PadPitchLength=par->GetOuter1PadPitchLength();
+ f2PadPitchLength=par->GetOuter2PadPitchLength();
+
+ fN=par->GetNRowUp();
+ fRow=new AliTPCRow[fN];
+ for (Int_t i=0; i<fN; i++){
+ fRow[i].SetX(par->GetPadRowRadiiUp(i));
+ }
+ }
+}
+
+//_________________________________________________________________________
+void AliTPCtracker::
+AliTPCRow::InsertCluster(const AliTPCcluster* c, Int_t sec, Int_t row) {
//-----------------------------------------------------------------------
// Insert a cluster into this pad row in accordence with its y-coordinate
//-----------------------------------------------------------------------
- if (fN==kMAXCLUSTER) {
- cerr<<"AliTPCRow::InsertCluster(): Too many clusters !\n"; return;
+ if (fN==kMaxClusterPerRow) {
+ ::Error("InsertCluster","Too many clusters !");
+ return;
+ }
+
+ Int_t index=(((sec<<8)+row)<<16)+fN;
+
+ if (fN==0) {
+ fSize=kMaxClusterPerRow/8;
+ fClusterArray=new AliTPCcluster[fSize];
+ fIndex[0]=index;
+ fClusterArray[0]=*c; fClusters[fN++]=fClusterArray;
+ return;
}
- if (fN==0) {fIndex[0]=index; fClusters[fN++]=c; return;}
+
+ if (fN==fSize) {
+ Int_t size=fSize*2;
+ AliTPCcluster *buff=new AliTPCcluster[size];
+ memcpy(buff,fClusterArray,fSize*sizeof(AliTPCcluster));
+ for (Int_t i=0; i<fN; i++)
+ fClusters[i]=buff+(fClusters[i]-fClusterArray);
+ delete[] fClusterArray;
+ fClusterArray=buff;
+ fSize=size;
+ }
+
Int_t i=Find(c->GetY());
memmove(fClusters+i+1 ,fClusters+i,(fN-i)*sizeof(AliTPCcluster*));
memmove(fIndex +i+1 ,fIndex +i,(fN-i)*sizeof(UInt_t));
- fIndex[i]=index; fClusters[i]=c; fN++;
+ fIndex[i]=index;
+ fClusters[i]=fClusterArray+fN; fClusterArray[fN++]=*c;
}
//___________________________________________________________________
//-----------------------------------------------------------------------
// Return the index of the nearest cluster
//-----------------------------------------------------------------------
+ if(fN<=0) return 0;
if (y <= fClusters[0]->GetY()) return 0;
if (y > fClusters[fN-1]->GetY()) return fN;
Int_t b=0, e=fN-1, m=(b+e)/2;
// This funtion calculates dE/dX within the "low" and "up" cuts.
//-----------------------------------------------------------------
Int_t i;
+ Int_t nc=GetNumberOfClusters();
Int_t swap;//stupid sorting
do {
swap=0;
- for (i=0; i<fN-1; i++) {
- if (fdEdx[i]<=fdEdx[i+1]) continue;
- Float_t tmp=fdEdx[i]; fdEdx[i]=fdEdx[i+1]; fdEdx[i+1]=tmp;
+ for (i=0; i<nc-1; i++) {
+ if (fdEdxSample[i]<=fdEdxSample[i+1]) continue;
+ Float_t tmp=fdEdxSample[i];
+ fdEdxSample[i]=fdEdxSample[i+1]; fdEdxSample[i+1]=tmp;
swap++;
}
} while (swap);
- Int_t nl=Int_t(low*fN), nu=Int_t(up*fN);
+ Int_t nl=Int_t(low*nc), nu=Int_t(up*nc);
Float_t dedx=0;
- for (i=nl; i<=nu; i++) dedx += fdEdx[i];
+ for (i=nl; i<=nu; i++) dedx += fdEdxSample[i];
dedx /= (nu-nl+1);
SetdEdx(dedx);
-}
-//_____________________________________________________________________________
-void AliTPCtracker::AliTPCseed::UseClusters(AliTPCClustersArray *ca, Int_t n) {
- //-----------------------------------------------------------------
- // This function marks clusters associated with this track.
- //-----------------------------------------------------------------
- Int_t sec,row,ncl;
- for (Int_t i=n; i<fN; i++) {
- GetCluster(i,sec,row,ncl);
- AliTPCClustersRow *clrow=ca->GetRow(sec,row);
- AliTPCcluster *c=(AliTPCcluster*)(*clrow)[ncl];
- c->Use();
+ //Very rough PID
+ Double_t p=TMath::Sqrt((1.+ GetTgl()*GetTgl())/(Get1Pt()*Get1Pt()));
+
+ Double_t log1=TMath::Log(p+0.45), log2=TMath::Log(p+0.12);
+ if (p<0.6) {
+ if (dedx < 34 + 30/(p+0.45)/(p+0.45) + 24*log1) {SetMass(0.13957); return;}
+ if (dedx < 34 + 30/(p+0.12)/(p+0.12) + 24*log2) {SetMass(0.49368); return;}
+ SetMass(0.93827); return;
+ }
+
+ if (p<1.2) {
+ if (dedx < 34 + 30/(p+0.12)/(p+0.12) + 24*log2) {SetMass(0.13957); return;}
+ SetMass(0.93827); return;
}
+
+ SetMass(0.13957); return;
+
}
+
git://git.uio.no / u / mrichter / AliRoot.git / blobdiff