Fixes for building of DA (Anshul)
[u/mrichter/AliRoot.git] / TPC / AliTPCComparison2.C
CommitLineData
6e9ab565 1/****************************************************************************
2 * Very important, delicate and rather obscure macro. *
3 * *
4 * Creates list of "trackable" tracks, *
5 * sorts tracks for matching with the ITS, *
6 * calculates efficiency, resolutions etc. *
7 * *
8 * Origin: I.Belikov, CERN, Jouri.Belikov@cern.ch *
9 * with several nice improvements by: M.Ivanov, GSI, m.ivanov@gsi.de *
10 ****************************************************************************/
11
12#if !defined(__CINT__) || defined(__MAKECINT__)
13#include<fstream.h>
14#include<TROOT.h>
15#include<TCanvas.h>
16#include<TClassTable.h>
17#include<TClonesArray.h>
18#include<TFile.h>
19#include<TFolder.h>
20#include<TH1.h>
21#include<TObject.h>
22#include<TObjArray.h>
23#include<TParticle.h>
24#include<TTree.h>
25#include <AliMagF.h>
26#include <AliRun.h>
27#include <AliTPCtracker.h>
28#include <alles.h>
29#endif
30
31/*
32 multievent comparison of reconstructed tracks with "exact tracks"
33 from silulation
34
35*/
36
37
38struct GoodTrackTPC {
39 Int_t fEventN; //event number
40 Int_t lab;
41 Int_t code;
42 Float_t px,py,pz;
43 Float_t x,y,z;
44};
45
46enum tagprimary {kPrimaryCharged = 0x4000};
47
48Int_t good_tracks(GoodTrackTPC *gt, Int_t max, Int_t firstev, Int_t eventn);
49
50Int_t FindPrimaries(Int_t nparticles);
51
52Int_t AliTPCComparison2(Int_t firstev=0, Int_t eventn=1) {
53
54 const Int_t MAX = 20000;
55 const Bool_t kOLD = kFALSE; // if tracking was done with a previous version
56 /***********************************************************************/
57
58 TFile *inkin = TFile::Open("rfio:galice.root");
59 // if(gAlice)delete gAlice; COMMENTED BECAUSE OF A BUG (IN COMPILED MODE)
60 gAlice = (AliRun*)inkin->Get("gAlice");
61 cout<<"AliRun object found on file "<<gAlice<<endl;
c84a5e9e 62 AliKalmanTrack::SetFieldMap(gAlice->Field());
6e9ab565 63 inkin->Close();
64 /*
65 delete gAlice; COMMENTED BECAUSE OF A BUG IN COMPILED MODE
66 gAlice = 0;
67 */
68 /***********************************************************************/
69 cerr<<"Doing comparison...\n";
70 Int_t i;
71 gBenchmark->Start("AliTPCComparison2");
72
73 TFile *cf=0;
74 AliTPCParam *digp=0;
75 if(kOLD){
76 cf=TFile::Open("AliTPCclusters.root");
77 if (!cf->IsOpen()) {cerr<<"Can't open AliTPCclusters.root !\n"; return 1;}
7a09f434 78 digp= (AliTPCParam*)cf->Get("75x40_100x60_150x60");
6e9ab565 79 if (!digp) { cerr<<"TPC parameters have not been found !\n"; return 2; }
80 }
81 ///////////
82 AliTPCtracker *tracker =0;
83 TObjArray tarray(MAX);
84 AliTPCtrack *iotrack=0;
85 Int_t nentr= 0;
86 Int_t eventptr[1000];
87 TFile *tf=TFile::Open("AliTPCtracks.root");
88 TTree *tracktree=0;
89
90 eventptr[firstev]=0;
91 eventptr[firstev+1]=0;
92 for (Int_t event=firstev;event<eventn; event++){
93 cout<<"================================================"<<endl;
94 cout<<"Processing event "<<event<<endl;
95 cout<<"================================================"<<endl;
6e9ab565 96
97 char tname[100];
98 if (eventn==-1) {
99 sprintf(tname,"TreeT_TPC");
100 }
101 else {
102 sprintf(tname,"TreeT_TPC_%d",event);
103 }
104
105 // Load tracks
106 if (!tf->IsOpen()) {cerr<<"Can't open AliTPCtracks.root !\n"; return 3;}
107
108 tracktree=(TTree*)tf->Get(tname);
109 if (!tracktree) {cerr<<"Can't get a tree with TPC tracks !\n"; return 4;}
110 TBranch *tbranch=tracktree->GetBranch("tracks");
111 Int_t nentr0=(Int_t)tracktree->GetEntries();
112 nentr+=nentr0;
113 for (i=0; i<nentr0; i++) {
114 iotrack=new AliTPCtrack;
115 tbranch->SetAddress(&iotrack);
116 tracktree->GetEvent(i);
5a9dee8b 117 // if(kOLD)tracker->CookLabel(iotrack,0.1);
6e9ab565 118 tarray.AddLast(iotrack);
119 }
120 eventptr[event+1] = nentr; //store end of the event
121 delete tracker;
122 delete tracktree;
123 }
124 tf->Close();
125 if(kOLD)cf->Close();
126
127 GoodTrackTPC gt[MAX];
128
129 Int_t ngood=0;
130 ifstream in("good_tracks_tpc");
131 if (in) {
132 cerr<<"Reading good tracks...\n";
133 while (in>>gt[ngood].fEventN>>gt[ngood].lab>>gt[ngood].code>>
134 gt[ngood].px>>gt[ngood].py>>gt[ngood].pz>>
135 gt[ngood].x >>gt[ngood].y >>gt[ngood].z) {
136 ngood++;
137 cerr<<ngood<<"\r";
7a09f434 138 //cout<<ngood<<"\r";
6e9ab565 139 if (ngood==MAX) {
140 cerr<<"Too many good tracks !\n";
141 break;
142 }
143 }
144 cout<<endl;
145 if (!in.eof()) cerr<<"Read error (good_tracks_tpc) !\n";
146 } else {
147 cerr<<"Marking good tracks (this will take a while)...\n";
148 ngood=good_tracks(gt,45000,firstev,eventn);
7a09f434 149 printf("Goood %d\n", ngood);
6e9ab565 150 ofstream out("good_tracks_tpc");
6e9ab565 151 if (out) {
152 cout<<"File good_tracks_tpc opened\n";
153 for (Int_t ngd=0; ngd<ngood; ngd++) {
6e9ab565 154 out<<gt[ngd].fEventN<<' '<<gt[ngd].lab<<' '<<gt[ngd].code<<' '<<
155 gt[ngd].px<<' '<<gt[ngd].py<<' '<<gt[ngd].pz<<' '<<
156 gt[ngd].x <<' '<<gt[ngd].y <<' '<<gt[ngd].z <<endl;
6e9ab565 157 }
158 } else cerr<<"Can not open file (good_tracks_tpc) !\n";
7a09f434 159 out<<flush;
6e9ab565 160 out.close();
7a09f434 161
162 ofstream out2("good_tracks_tpc_par");
163
164 if (out2) {
165 //cout<<"File good_tracks_tpc opened\n";
166 for (Int_t ngd=0; ngd<ngood; ngd++) {
167 Float_t pt = TMath::Sqrt(gt[ngd].px*gt[ngd].px+gt[ngd].py*gt[ngd].py);
168 Float_t angle = 0;
169 if (TMath::Abs(pt)>0.01) angle = gt[ngd].pz/pt;
170 out2<<gt[ngd].fEventN<<"\t"<<gt[ngd].lab<<"\t"<<gt[ngd].code<<"\t"<<
171 pt<<"\t"<<angle<<"\t"<<endl;
172 }
173 } else cerr<<"Can not open file (good_tracks_tpc) !\n";
174 out2<<flush;
6e9ab565 175 out2.close();
7a09f434 176
6e9ab565 177 }
178 cerr<<"Number of good tracks : "<<ngood<<endl;
7a09f434 179 cout<<"Number of good tracks : "<<ngood<<endl;
6e9ab565 180 if(ngood==0)return 5;
7a09f434 181 TH1F *hp=new TH1F("hp","PHI resolution",50,-20.,20.); hp->SetFillColor(4);
182 TH1F *hl=new TH1F("hl","LAMBDA resolution",50,-20,20);hl->SetFillColor(4);
6e9ab565 183 TH1F *hpt=new TH1F("hpt","Relative Pt resolution",30,-10.,10.);
184 hpt->SetFillColor(2);
185 TH1F *hmpt=new TH1F("hmpt","Relative Pt resolution (pt>4GeV/c)",30,-60,60);
186 hmpt->SetFillColor(6);
187
188 AliTPCtrack *trk=(AliTPCtrack*)tarray.UncheckedAt(0);
189
190 Double_t pmin=0.1*(100/0.299792458/0.2/trk->GetConvConst());
191 Double_t pmax=6.0+pmin;
192
193 TH1F *hgood=new TH1F("hgood","Good tracks",30,pmin,pmax);
194 TH1F *hfound=new TH1F("hfound","Found tracks",30,pmin,pmax);
195 TH1F *hfake=new TH1F("hfake","Fake tracks",30,pmin,pmax);
196 TH1F *hg=new TH1F("hg","",30,pmin,pmax); //efficiency for good tracks
197 hg->SetLineColor(4); hg->SetLineWidth(2);
198 TH1F *hf=new TH1F("hf","Efficiency for fake tracks",30,pmin,pmax);
199 hf->SetFillColor(1); hf->SetFillStyle(3013); hf->SetLineWidth(2);
200
201 TH1F *he =new TH1F("he","dE/dX for pions with 0.4<p<0.5 GeV/c",50,0.,100.);
202 TH2F *hep=new TH2F("hep","dE/dX vs momentum",50,0.,2.,50,0.,250.);
203 hep->SetMarkerStyle(8);
204 hep->SetMarkerSize(0.4);
205
206 Int_t mingood=ngood;
207 Int_t track_notfound[MAX], itrack_notfound=0;
208 Int_t track_fake[MAX], itrack_fake=0;
209 Int_t track_multifound[MAX], track_multifound_n[MAX], itrack_multifound=0;
210 while (ngood--) {
211 Int_t lab=gt[ngood].lab,tlab=-1;
212 Float_t ptg=
213 TMath::Sqrt(gt[ngood].px*gt[ngood].px + gt[ngood].py*gt[ngood].py);
214
215 if (ptg<pmin) continue; // Should be 1e-33 instead pmin?
216
217 hgood->Fill(ptg);
218 Int_t ievent = gt[ngood].fEventN;
219
220 AliTPCtrack *track=0;
221 for (i=eventptr[ievent]; i<eventptr[ievent+1]; i++) {
222
223 track=(AliTPCtrack*)tarray.UncheckedAt(i);
224 tlab=track->GetLabel();
225 if (lab==TMath::Abs(tlab)) break;
226 }
227 if (i==eventptr[ievent+1]) {
228 track_notfound[itrack_notfound++]=lab;
229 continue;
230 }
231
232 Int_t micount=0;
233 Int_t mi;
234 AliTPCtrack * mitrack;
235 for (mi=eventptr[ievent]; mi<eventptr[ievent+1]; mi++) {
236
237 mitrack=(AliTPCtrack*)tarray.UncheckedAt(mi);
238 if (lab==TMath::Abs(mitrack->GetLabel())) micount++;
239 }
240 if (micount>1) {
241 track_multifound[itrack_multifound]=lab;
242 track_multifound_n[itrack_multifound]=micount;
243 itrack_multifound++;
244 }
245
246 //
247 Double_t xk=gt[ngood].x;
7a09f434 248 if (!track) continue;
249 // printf("Track =%p\n",track);
6e9ab565 250 track->PropagateTo(xk);
251
252 if (lab==tlab) hfound->Fill(ptg);
253 else {
254 track_fake[itrack_fake++]=lab;
255 hfake->Fill(ptg);
256 }
257 Double_t par[5]; track->GetExternalParameters(xk,par);
258 Float_t phi=TMath::ASin(par[2]) + track->GetAlpha();
259 if (phi<-TMath::Pi()) phi+=2*TMath::Pi();
260 if (phi>=TMath::Pi()) phi-=2*TMath::Pi();
261 Float_t lam=TMath::ATan(par[3]);
262 Float_t pt_1=TMath::Abs(par[4]);
263
264 if (TMath::Abs(gt[ngood].code)==11 && ptg>4.) {
265 hmpt->Fill((pt_1 - 1/ptg)/(1/ptg)*100.);
7a09f434 266 }
267 //else
268 {
6e9ab565 269 Float_t phig=TMath::ATan2(gt[ngood].py,gt[ngood].px);
270 hp->Fill((phi - phig)*1000.);
271
272 Float_t lamg=TMath::ATan2(gt[ngood].pz,ptg);
273 hl->Fill((lam - lamg)*1000.);
274
275 hpt->Fill((pt_1 - 1/ptg)/(1/ptg)*100.);
276 }
277
278 Float_t mom=1./(pt_1*TMath::Cos(lam));
279 Float_t dedx=track->GetdEdx();
280 hep->Fill(mom,dedx,1.);
281 if (TMath::Abs(gt[ngood].code)==211)
282 if (mom>0.4 && mom<0.5) {
283 he->Fill(dedx,1.);
284 }
285
286 }
287
288 cout<<"\nList of Not found tracks :\n";
289 for ( i = 0; i< itrack_notfound; i++){
290 cout<<track_notfound[i]<<"\t";
291 if ((i%5)==4) cout<<"\n";
292 }
293 cout<<"\nList of fake tracks :\n";
294 for ( i = 0; i< itrack_fake; i++){
295 cout<<track_fake[i]<<"\t";
296 if ((i%5)==4) cout<<"\n";
297 }
298 cout<<"\nList of multiple found tracks :\n";
299 for ( i=0; i<itrack_multifound; i++) {
300 cout<<"id. "<<track_multifound[i]
301 <<" found - "<<track_multifound_n[i]<<"times\n";
302 }
303
304 Stat_t ng=hgood->GetEntries(), nf=hfound->GetEntries();
305 if (ng!=0) cerr<<"\n\nIntegral efficiency is about "<<nf/ng*100.<<" %\n";
7a09f434 306 if (ng!=0) cout<<"\n\nIntegral efficiency is about "<<nf/ng*100.<<" %\n";
6e9ab565 307 cout<<"Total number of found tracks ="<<nentr<<endl;
308 cout<<"Total number of \"good\" tracks ="
309 <<mingood<<" (selected for comparison: "<<ng<<')'<<endl<<endl;
310
311
312 gStyle->SetOptStat(111110);
313 gStyle->SetOptFit(1);
314
315 TCanvas *c1=new TCanvas("c1","",0,0,700,850);
316
317 TPad *p1=new TPad("p1","",0,0.3,.5,.6); p1->Draw();
318 p1->cd(); p1->SetFillColor(42); p1->SetFrameFillColor(10);
319 hp->SetFillColor(4); hp->SetXTitle("(mrad)"); hp->Fit("gaus"); c1->cd();
320
321 TPad *p2=new TPad("p2","",0.5,.3,1,.6); p2->Draw();
322 p2->cd(); p2->SetFillColor(42); p2->SetFrameFillColor(10);
323 hl->SetXTitle("(mrad)"); hl->Fit("gaus"); c1->cd();
324
325 TPad *p3=new TPad("p3","",0,0,0.5,0.3); p3->Draw();
326 p3->cd(); p3->SetFillColor(42); p3->SetFrameFillColor(10);
327 hpt->SetXTitle("(%)"); hpt->Fit("gaus"); c1->cd();
328
329 TPad *p4=new TPad("p4","",0.5,0,1,0.3); p4->Draw();
330 p4->cd(); p4->SetFillColor(42); p4->SetFrameFillColor(10);
331 hmpt->SetXTitle("(%)"); hmpt->Fit("gaus"); c1->cd();
332
333 TPad *p5=new TPad("p5","",0,0.6,1,1); p5->Draw(); p5->cd();
334 p5->SetFillColor(41); p5->SetFrameFillColor(10);
335 hfound->Sumw2(); hgood->Sumw2(); hfake->Sumw2();
336 hg->Divide(hfound,hgood,1,1.,"b");
337 hf->Divide(hfake,hgood,1,1.,"b");
338 hg->SetMaximum(1.4);
339 hg->SetYTitle("Tracking efficiency");
340 hg->SetXTitle("Pt (GeV/c)");
341 hg->Draw();
342
343 TLine *line1 = new TLine(pmin,1.0,pmax,1.0); line1->SetLineStyle(4);
344 line1->Draw("same");
345 TLine *line2 = new TLine(pmin,0.9,pmax,0.9); line2->SetLineStyle(4);
346 line2->Draw("same");
347
348 hf->SetFillColor(1);
349 hf->SetFillStyle(3013);
350 hf->SetLineColor(2);
351 hf->SetLineWidth(2);
352 hf->Draw("histsame");
353 TText *text = new TText(0.461176,0.248448,"Fake tracks");
354 text->SetTextSize(0.05);
355 text->Draw();
356 text = new TText(0.453919,1.11408,"Good tracks");
357 text->SetTextSize(0.05);
358 text->Draw();
359
360
361
362 TCanvas *c2=new TCanvas("c2","",320,32,530,590);
363
364 TPad *p6=new TPad("p6","",0.,0.,1.,.5); p6->Draw();
365 p6->cd(); p6->SetFillColor(42); p6->SetFrameFillColor(10);
366 he->SetFillColor(2); he->SetFillStyle(3005);
367 he->SetXTitle("Arbitrary Units");
368 he->Fit("gaus"); c2->cd();
369
370 TPad *p7=new TPad("p7","",0.,0.5,1.,1.); p7->Draw();
371 p7->cd(); p7->SetFillColor(42); p7->SetFrameFillColor(10);
372 hep->SetXTitle("p (Gev/c)"); hep->SetYTitle("dE/dX (Arb. Units)");
373 hep->Draw(); c1->cd();
374
375 gBenchmark->Stop("AliTPCComparison2");
376 gBenchmark->Show("AliTPCComparison2");
377
378
379 return 0;
380}
381
382
383Int_t good_tracks(GoodTrackTPC *gt, Int_t max, Int_t firstev, Int_t eventn) {
384 //eventn - number of events in file
385
7a09f434 386 TFile *file=TFile::Open("galice.root");
6e9ab565 387 if (!file->IsOpen()) {cerr<<"Can't open galice.root !\n"; exit(4);}
388 // delete gAlice; gAlice = 0;
389 if (!(gAlice=(AliRun*)file->Get("gAlice"))) {
390 cerr<<"gAlice have not been found on galice.root !\n";
391 exit(5);
392 }
1c53abe2 393
394 TFile *fdigit = TFile::Open("digits.root");
395 file->cd();
6e9ab565 396
397 AliTPC *TPC=(AliTPC*)gAlice->GetDetector("TPC");
398 Int_t ver = TPC->IsVersion();
399 cerr<<"TPC version "<<ver<<" has been found !\n";
400
401 AliTPCParam *digp=(AliTPCParam*)file->Get("75x40_100x60");
7a09f434 402 if(digp){
403 cerr<<"2 pad-lenght geom hits with 3 pad-length geom digits...\n";
404 delete digp;
405 digp = new AliTPCParamSR();
406 }
407 else
408 {
409 digp =(AliTPCParam*)gDirectory->Get("75x40_100x60_150x60");
410 }
411
6e9ab565 412 if (!digp) { cerr<<"TPC parameters have not been found !\n"; exit(6); }
413 TPC->SetParam(digp);
414
415 Int_t nrow_up=digp->GetNRowUp();
416 Int_t nrows=digp->GetNRowLow()+nrow_up;
417 Int_t zero=digp->GetZeroSup();
418 Int_t gap=Int_t(0.125*nrows), shift=Int_t(0.5*gap);
419 Int_t good_number=Int_t(0.4*nrows);
420
421 Int_t nt=0; //reset counter
422 char treeName[100]; //declare event identifier
423
424 for (Int_t event=firstev;event<eventn;event++){
425 Int_t np=gAlice->GetEvent(event);
426 Int_t nopr = FindPrimaries(np);
427 cout<<"function good_tracks -- event "<<event<<", Charged primaries:"<<nopr<<"\n";
428
429 Int_t *good=new Int_t[np];
430 for (Int_t ii=0; ii<np; ii++) good[ii]=0;
431
432
433 Int_t sectors_by_rows=0;
434 TTree *TD=0;
435 AliSimDigits da, *digits=&da;
436 Int_t *count=0;
437 switch (ver) {
438 case 1:
439 {
440 TFile *cf=TFile::Open("AliTPCclusters.root");
441 if (!cf->IsOpen()){cerr<<"Can't open AliTPCclusters.root !\n";exit(5);}
442 AliTPCClustersArray *ca=new AliTPCClustersArray;
443 ca->Setup(digp);
444 ca->SetClusterType("AliTPCcluster");
445 ca->ConnectTree("TreeC_TPC_0");
446 Int_t nrows=Int_t(ca->GetTree()->GetEntries());
447 for (Int_t n=0; n<nrows; n++) {
448 AliSegmentID *s=ca->LoadEntry(n);
449 Int_t sec,row;
450 digp->AdjustSectorRow(s->GetID(),sec,row);
451 AliTPCClustersRow &clrow = *ca->GetRow(sec,row);
452 Int_t ncl=clrow.GetArray()->GetEntriesFast();
453 while (ncl--) {
454 AliTPCcluster *c=(AliTPCcluster*)clrow[ncl];
455 Int_t lab=c->GetLabel(0);
456 if (lab<0) continue; //noise cluster
457 lab=TMath::Abs(lab);
458 if (sec>=digp->GetNInnerSector())
459 if (row==nrow_up-1 ) good[lab]|=0x1000;
460 if (sec>=digp->GetNInnerSector())
461 if (row==nrow_up-1-gap) good[lab]|=0x800;
462 good[lab]++;
463 }
464 ca->ClearRow(sec,row);
465 }
466 delete ca;
467 cf->Close();
468 }
469 break;
470 case 2:
471 {
7a09f434 472 sprintf(treeName,"TreeD_75x40_100x60_150x60_%d",event);
88cb7938 473 TD=(TTree*)fdigit->Get(treeName); // To be revised according to
474 // NewIO schema M.Kowalski
6e9ab565 475 TD->GetBranch("Segment")->SetAddress(&digits);
476 count = new Int_t[np];
477 Int_t i;
478 for (i=0; i<np; i++) count[i]=0;
479 sectors_by_rows=(Int_t)TD->GetEntries();
480 for (i=0; i<sectors_by_rows; i++) {
481 if (!TD->GetEvent(i)) continue;
482 Int_t sec,row;
483 digp->AdjustSectorRow(digits->GetID(),sec,row);
484 digits->First();
1c53abe2 485 digits->ExpandTrackBuffer();
6e9ab565 486 do { //Many thanks to J.Chudoba who noticed this
487 Int_t it=digits->CurrentRow(), ip=digits->CurrentColumn();
1c53abe2 488 // Short_t dig = digits->GetDigit(it,ip);
489 Short_t dig = digits->CurrentDigit();
490
491 Int_t idx0=digits->GetTrackIDFast(it,ip,0)-2;
492 Int_t idx1=digits->GetTrackIDFast(it,ip,1)-2;
493 Int_t idx2=digits->GetTrackIDFast(it,ip,2)-2;
6e9ab565 494 if (idx0>=0 && dig>=zero && idx0<np ) count[idx0]+=1; //background events - higher track ID's
495 if (idx1>=0 && dig>=zero && idx1<np ) count[idx1]+=1;
496 if (idx2>=0 && dig>=zero && idx2<np ) count[idx2]+=1;
497 } while (digits->Next());
498 for (Int_t j=0; j<np; j++) {
499 if (count[j]>1) {
500 if (sec>=digp->GetNInnerSector())
501 if (row==nrow_up-1 ) good[j]|=0x4000;
502 if (sec>=digp->GetNInnerSector())
503 if (row==nrow_up-1-gap) good[j]|=0x1000;
504
505 if (sec>=digp->GetNInnerSector())
506 if (row==nrow_up-1-shift) good[j]|=0x2000;
507 if (sec>=digp->GetNInnerSector())
508 if (row==nrow_up-1-gap-shift) good[j]|=0x800;
509 good[j]++;
510 }
511 count[j]=0;
512 }
513
514 }
515 delete[] count;
516 delete TD; //Thanks to Mariana Bondila
517 }
518 break;
519 default:
520 cerr<<"Invalid TPC version !\n";
521 file->Close();
522 exit(7);
523 }
524
525 /** select tracks which are "good" enough **/
7a09f434 526 //printf("\t %d \n",np);
6e9ab565 527 for (Int_t i=0; i<np; i++) {
528 if ((good[i]&0x5000) != 0x5000)
529 if ((good[i]&0x2800) != 0x2800) continue;
530 if ((good[i]&0x7FF ) < good_number) continue;
531
532 TParticle *p = (TParticle*)gAlice->Particle(i);
533
534 if (p->Pt()<0.100) continue;
535 if (TMath::Abs(p->Pz()/p->Pt())>0.999) continue;
536 // THIS IS GOOD IF YOU WANT SECONDARIES
537 Int_t j=p->GetFirstMother();
538 if (j>=0) {
539 TParticle *pp = (TParticle*)gAlice->Particle(j);
540 //if (!(pp->TestBit(kPrimaryCharged))) continue; //only one decay is allowed
541 }
542
7a09f434 543 if(!(p->TestBit(kPrimaryCharged)))continue; // only primaries
544 // printf("1");
6e9ab565 545
546 gt[nt].fEventN=event;
547 gt[nt].lab=i;
548 gt[nt].code=p->GetPdgCode();
549 gt[nt].px=0.; gt[nt].py=0.; gt[nt].pz=0.;
527abbe9 550 gt[nt].x=0.; gt[nt].y=0.; gt[nt].z=0.;
6e9ab565 551 nt++;
552 if (nt==max) {cerr<<"Too many good tracks !\n"; break;}
553 cerr<<np-i<<" \r";
554 }
555
556 /** check if there is also information at the entrance of the TPC **/
557 TTree *TH=gAlice->TreeH(); np=(Int_t)TH->GetEntries();
558 cout<<endl;
559 for (Int_t i=0; i<np; i++) {
560 TPC->ResetHits();
561 TH->GetEvent(i);
562 AliTPChit *phit = (AliTPChit*)TPC->FirstHit(-1);
563 for ( ; phit; phit=(AliTPChit*)TPC->NextHit() ) {
564 if (phit->fQ !=0. ) continue;
565
566 Double_t px=phit->X(), py=phit->Y(), pz=phit->Z();
567
568 if ((phit=(AliTPChit*)TPC->NextHit())==0) break;
569 if (phit->fQ != 0.) continue;
570
571 Double_t x=phit->X(), y=phit->Y(), z=phit->Z();
572 if (TMath::Sqrt(x*x+y*y)>90.) continue;
573
574 Int_t j, lab=phit->Track();
575 for (j=0; j<nt; j++) {if (gt[j].fEventN==event && gt[j].lab==lab) break;}
576 if (j==nt) continue;
7a09f434 577 //printf("1-");
6e9ab565 578 // (px,py,pz) - in global coordinate system, (x,y,z) - in local !
579 gt[j].px=px; gt[j].py=py; gt[j].pz=pz;
580 Float_t cs,sn; digp->AdjustCosSin(phit->fSector,cs,sn);
581 gt[j].x = x*cs + y*sn;
582 gt[j].y =-x*sn + y*cs;
583 gt[j].z = z;
584 }
585 cerr<<np-i<<" \r";
586 }
7a09f434 587 //printf("\n%d\n",nt);
6e9ab565 588 cout<<endl;
589 delete[] good;
590 } // /// loop on events
591 delete gAlice; gAlice=0;
592
593 file->Close();
594 gBenchmark->Stop("AliTPCComparison2");
595 gBenchmark->Show("AliTPCComparison2");
596 return nt;
597
598}
599
600Int_t FindPrimaries(Int_t nparticles){
601
602 // cuts:
603 Double_t vertcut = 0.001;
604 Double_t decacut = 3.;
605 Double_t timecut = 0.;
606 Int_t nprch1=0;
607 TParticle * part = gAlice->Particle(0);
608 Double_t xori = part->Vx();
609 Double_t yori = part->Vy();
610 Double_t zori = part->Vz();
611 for(Int_t iprim = 0; iprim<nparticles; iprim++){ //loop on tracks
612
613 part = gAlice->Particle(iprim);
1c53abe2 614 Double_t ptot=TMath::Sqrt(part->Px()*part->Px()+part->Py()*part->Py()+part->Pz()*part->Pz());
615 if (ptot<0.01) continue;
6e9ab565 616 char *xxx=strstr(part->GetName(),"XXX");
617 if(xxx)continue;
618
619 TParticlePDG *ppdg = part->GetPDG();
620 if(TMath::Abs(ppdg->Charge())!=3)continue; // only charged (no quarks)
621
622 Double_t dist=TMath::Sqrt((part->Vx()-xori)*(part->Vx()-xori)+(part->Vy()-yori)*(part->Vy()-yori)+(part->Vz()-zori)*(part->Vz()-zori));
623 if(dist>vertcut)continue; // cut on the vertex
624
625 if(part->T()>timecut)continue;
626
1c53abe2 627 //Double_t ptot=TMath::Sqrt(part->Px()*part->Px()+part->Py()*part->Py()+part->Pz()*part->Pz());
6e9ab565 628 if(ptot==(TMath::Abs(part->Pz())))continue; // no beam particles
629
630 Bool_t prmch = kTRUE; // candidate primary track
631 Int_t fidau=part->GetFirstDaughter(); // cut on daughters
632 Int_t lasdau=0;
633 Int_t ndau=0;
634 if(fidau>=0){
635 lasdau=part->GetLastDaughter();
636 ndau=lasdau-fidau+1;
637 }
638 if(ndau>0){
639 for(Int_t j=fidau;j<=lasdau;j++){
640 TParticle *dau=gAlice->Particle(j);
641 Double_t distd=TMath::Sqrt((dau->Vx()-xori)*(dau->Vx()-xori)+(dau->Vy()-yori)*(dau->Vy()-yori)+(dau->Vz()-zori)*(dau->Vz()-zori));
642 if(distd<decacut)prmch=kFALSE; // eliminate if the decay is near the vertex
643 }
644 }
645
646 if(prmch){
647 nprch1++;
648 part->SetBit(kPrimaryCharged);
649 }
650 }
651
652 return nprch1;
653}
654