]>
Commit | Line | Data |
---|---|---|
b661165c | 1 | // Author: Anders Vestbo <mailto:vestbo@fi.uib.no> |
2 | //*-- Copyright © ASV | |
108615fc | 3 | |
4 | #include <stdio.h> | |
e170e0f9 | 5 | #include <math.h> |
40896357 | 6 | #include <fstream.h> |
108615fc | 7 | #include <TFile.h> |
8 | #include <TH1.h> | |
9 | #include <TParticle.h> | |
10 | #include <TTree.h> | |
11 | #include <TClonesArray.h> | |
12 | ||
13 | #include "AliRun.h" | |
14 | #include "AliSimDigits.h" | |
15 | #include "AliTPC.h" | |
16 | #include "AliTPCClustersArray.h" | |
17 | #include "AliTPCClustersRow.h" | |
18 | #include "AliTPCcluster.h" | |
19 | #include "AliTPCParam.h" | |
e1a32fa5 | 20 | #include "AliComplexCluster.h" |
108615fc | 21 | |
22 | #include "AliL3Transform.h" | |
23 | #include "AliL3SpacePointData.h" | |
24 | #include "AliL3Track.h" | |
25 | #include "AliL3FileHandler.h" | |
26 | #include "AliL3TrackArray.h" | |
27 | #include "AliL3Evaluate.h" | |
28 | #include "AliL3Logging.h" | |
29 | ||
b661165c | 30 | //_____________________________________________________________ |
31 | // AliL3Evaluate | |
32 | // | |
33 | // Evaluation class for tracking. Plots efficiencies etc.. | |
108615fc | 34 | |
35 | ClassImp(AliL3Evaluate) | |
36 | ||
37 | AliL3Evaluate::AliL3Evaluate() | |
38 | { | |
e1a32fa5 | 39 | fDigitsFile = NULL; |
108615fc | 40 | fTracks = NULL; |
41 | fMCclusterfile = NULL; | |
c0217812 | 42 | fNFastPoints = 0; |
43 | fMcIndex = 0; | |
44 | fMcId = 0; | |
1f79afc0 | 45 | fMinSlice=0; |
46 | fMaxSlice=0; | |
108615fc | 47 | } |
48 | ||
40896357 | 49 | AliL3Evaluate::AliL3Evaluate(Char_t *mcfile,Int_t *slice) |
108615fc | 50 | { |
51 | //Normal constructor. Input are the rootfile containing the | |
52 | //original MC information of the simulated event. | |
53 | ||
e1a32fa5 | 54 | fEventFile = new TFile(mcfile,"READ"); |
40896357 | 55 | |
e1a32fa5 | 56 | fParam = (AliTPCParam*)fEventFile->Get("75x40_100x60"); |
108615fc | 57 | |
58 | fMinSlice = slice[0]; | |
59 | fMaxSlice = slice[1]; | |
e170e0f9 | 60 | fMinGoodPt = 0.1; |
23908b9b | 61 | fNoOverlap = kFALSE; |
108615fc | 62 | } |
63 | ||
1f79afc0 | 64 | AliL3Evaluate::AliL3Evaluate(Int_t *slice) |
65 | { | |
78127e35 | 66 | //ctor to use if you do not need any rootfile. |
67 | ||
1f79afc0 | 68 | |
69 | fMinSlice = slice[0]; | |
70 | fMaxSlice = slice[1]; | |
1f79afc0 | 71 | |
72 | } | |
73 | ||
108615fc | 74 | AliL3Evaluate::~AliL3Evaluate() |
75 | { | |
c0217812 | 76 | if(fDigitsTree) fDigitsTree->Delete(); |
e1a32fa5 | 77 | if(fDigitsFile) { |
78 | fDigitsFile->Close(); | |
79 | delete fDigitsFile; | |
c0217812 | 80 | } |
c0217812 | 81 | if(fTracks) delete fTracks; |
82 | if(fPtRes) delete fPtRes; | |
83 | if(fNGoodTracksPt) delete fNGoodTracksPt; | |
84 | if(fNFoundTracksPt) delete fNFoundTracksPt; | |
85 | if(fNFakeTracksPt) delete fNFakeTracksPt; | |
86 | if(fTrackEffPt) delete fTrackEffPt; | |
87 | if(fFakeTrackEffPt) delete fFakeTrackEffPt; | |
88 | if(fNGoodTracksEta) delete fNGoodTracksEta; | |
89 | if(fNFoundTracksEta) delete fNFoundTracksEta; | |
90 | if(fNFakeTracksEta) delete fNFakeTracksEta; | |
91 | if(fTrackEffEta) delete fTrackEffEta; | |
92 | if(fFakeTrackEffEta) delete fFakeTrackEffEta; | |
93 | if(fMcIndex) delete [] fMcIndex; | |
94 | if(fMcId) delete [] fMcId; | |
1f79afc0 | 95 | if(fNtuppel) delete fNtuppel; |
108615fc | 96 | } |
97 | ||
bc2f4f0e | 98 | void AliL3Evaluate::Setup(Char_t *trackfile,Char_t *path) |
108615fc | 99 | { |
108615fc | 100 | //Read in the hit and track information from produced files. |
101 | ||
23908b9b | 102 | fGoodFound = 0; |
103 | fGoodGen = 0; | |
108615fc | 104 | Char_t fname[256]; |
40896357 | 105 | AliL3FileHandler *clusterfile[36][6]; |
108615fc | 106 | for(Int_t s=fMinSlice; s<=fMaxSlice; s++) |
107 | { | |
40896357 | 108 | for(Int_t p=0; p<6; p++) |
108615fc | 109 | { |
1f79afc0 | 110 | fClusters[s][p] = 0; |
108615fc | 111 | clusterfile[s][p] = new AliL3FileHandler(); |
bc2f4f0e | 112 | sprintf(fname,"%s/points_%d_%d.raw",path,s,p); |
108615fc | 113 | if(!clusterfile[s][p]->SetBinaryInput(fname)) |
114 | { | |
115 | LOG(AliL3Log::kError,"AliL3Evaluation::Setup","File Open") | |
116 | <<"Inputfile "<<fname<<" does not exist"<<ENDLOG; | |
bc2f4f0e | 117 | delete clusterfile[s][p]; |
118 | clusterfile[s][p] = 0; | |
119 | continue; | |
108615fc | 120 | } |
121 | fClusters[s][p] = (AliL3SpacePointData*)clusterfile[s][p]->Allocate(); | |
122 | clusterfile[s][p]->Binary2Memory(fNcl[s][p],fClusters[s][p]); | |
123 | clusterfile[s][p]->CloseBinaryInput(); | |
124 | } | |
125 | } | |
78127e35 | 126 | |
23908b9b | 127 | |
108615fc | 128 | AliL3FileHandler *tfile = new AliL3FileHandler(); |
bc2f4f0e | 129 | if(!tfile->SetBinaryInput(trackfile)){ |
130 | LOG(AliL3Log::kError,"AliL3Evaluation::Setup","File Open") | |
131 | <<"Inputfile "<<trackfile<<" does not exist"<<ENDLOG; | |
132 | return; | |
133 | } | |
108615fc | 134 | fTracks = new AliL3TrackArray(); |
135 | tfile->Binary2TrackArray(fTracks); | |
136 | tfile->CloseBinaryInput(); | |
137 | delete tfile; | |
bc2f4f0e | 138 | } |
139 | ||
40896357 | 140 | void AliL3Evaluate::SetupSlow(Char_t *trackfile,Char_t *digitsfile,Char_t *path) |
bc2f4f0e | 141 | { |
142 | //Setup for using the slow simulator. | |
143 | ||
40896357 | 144 | fDigitsFile = new TFile(digitsfile,"READ"); |
145 | if(!fDigitsFile->IsOpen()) | |
146 | { | |
147 | LOG(AliL3Log::kError,"AliL3Evaluate::SetupSlow","File Open") | |
148 | <<"Inputfile "<<digitsfile<<" does not exist"<<ENDLOG; | |
149 | return; | |
150 | } | |
bc2f4f0e | 151 | fIsSlow = true; |
152 | Setup(trackfile,path); | |
108615fc | 153 | |
e1a32fa5 | 154 | if(!InitMC()) |
bc2f4f0e | 155 | LOG(AliL3Log::kError,"AliL3Evaluation::SetupSlow","Digits Tree") |
156 | <<"Error setting up digits tree"<<ENDLOG; | |
e1a32fa5 | 157 | |
108615fc | 158 | } |
159 | ||
bc2f4f0e | 160 | void AliL3Evaluate::SetupFast(Char_t *trackfile,Char_t *mcClusterfile,Char_t *path) |
108615fc | 161 | { |
162 | //Setup for using the fast simulator. | |
163 | ||
164 | fIsSlow = false; | |
c0217812 | 165 | GetFastClusterIDs(path); |
108615fc | 166 | |
167 | fMCclusterfile = new TFile(mcClusterfile); | |
168 | if(!fMCclusterfile->IsOpen()) | |
169 | LOG(AliL3Log::kError,"AliL3Evaluation::SetupFast","File Open") | |
170 | <<"Inputfile "<<mcClusterfile<<" does not exist"<<ENDLOG; | |
171 | ||
bc2f4f0e | 172 | Setup(trackfile,path); |
e1a32fa5 | 173 | InitMC(); |
108615fc | 174 | } |
175 | ||
e1a32fa5 | 176 | Bool_t AliL3Evaluate::InitMC() |
108615fc | 177 | { |
e1a32fa5 | 178 | if(fIsSlow) |
108615fc | 179 | { |
e1a32fa5 | 180 | fDigitsFile->cd(); |
40896357 | 181 | fDigitsTree = (TTree*)fDigitsFile->Get("TreeD_75x40_100x60_0"); |
182 | if(!fDigitsTree) | |
183 | { | |
184 | LOG(AliL3Log::kError,"AliL3Evaluate::InitMC","Digits Tree") | |
185 | <<AliL3Log::kHex<<"Error getting digitstree "<<(Int_t)fDigitsTree<<ENDLOG; | |
186 | return false; | |
187 | } | |
e1a32fa5 | 188 | fDigitsTree->GetBranch("Segment")->SetAddress(&fDigits); |
189 | for(Int_t i=0; i<fDigitsTree->GetEntries(); i++) | |
190 | { | |
191 | if(!fDigitsTree->GetEvent(i)) continue; | |
192 | Int_t se,ro,slice,slicerow; | |
193 | fParam->AdjustSectorRow(fDigits->GetID(),se,ro); | |
494fad94 | 194 | AliL3Transform::Sector2Slice(slice,slicerow,se,ro); |
e1a32fa5 | 195 | fRowid[slice][slicerow] = i; |
196 | } | |
108615fc | 197 | } |
198 | ||
e1a32fa5 | 199 | fEventFile->cd(); |
40896357 | 200 | gAlice = (AliRun*)fEventFile->Get("gAlice"); |
108615fc | 201 | if (!gAlice) |
202 | { | |
40896357 | 203 | LOG(AliL3Log::kError,"AliL3Evaluate::InitMC","gAlice") |
108615fc | 204 | <<"AliRun object non existing on file"<<ENDLOG; |
205 | return false; | |
206 | } | |
207 | ||
208 | gAlice->GetEvent(0); | |
e1a32fa5 | 209 | |
108615fc | 210 | return true; |
e1a32fa5 | 211 | |
108615fc | 212 | } |
213 | ||
214 | ||
e1a32fa5 | 215 | |
40896357 | 216 | void AliL3Evaluate::DefineGoodTracks(Int_t *slice,Int_t *padrow,Int_t good_number,Char_t *fname) |
108615fc | 217 | { |
218 | //Loop over MC particles, and mark the good ones | |
219 | //(which the tracker should find...) | |
e1a32fa5 | 220 | |
40896357 | 221 | |
222 | ifstream in(fname); | |
223 | if(in) | |
224 | { | |
225 | LOG(AliL3Log::kInformational,"AliL3Evaluate::DefineGoodTracks","infile") | |
226 | <<"Reading good particles from file "<<fname<<ENDLOG; | |
227 | while (in>>fGoodTracks[fGoodGen].label>>fGoodTracks[fGoodGen].code>> | |
228 | fGoodTracks[fGoodGen].px>>fGoodTracks[fGoodGen].py>>fGoodTracks[fGoodGen].pz>> | |
229 | fGoodTracks[fGoodGen].pt) | |
230 | { | |
231 | fGoodGen++; | |
232 | if (fGoodGen==15000) | |
233 | { | |
234 | LOG(AliL3Log::kWarning,"AliL3Evaluate::DefineGoodTracks","fGoodGen") | |
235 | <<"Too many good tracks"<<ENDLOG; | |
236 | break; | |
237 | } | |
238 | } | |
239 | if (!in.eof()) cerr<<"Read error (good_tracks_tpc) !\n"; | |
240 | return; | |
241 | } | |
242 | ||
243 | ||
108615fc | 244 | AliTPC *TPC = (AliTPC*)gAlice->GetDetector("TPC"); |
e1a32fa5 | 245 | |
108615fc | 246 | TPC->SetParam(fParam); |
e1a32fa5 | 247 | |
108615fc | 248 | Int_t ver = TPC->IsVersion(); |
249 | LOG(AliL3Log::kInformational,"AliL3Evaluate::DefineGoodTracks","TPC version") | |
250 | <<"TPC version "<<ver<<" found on file"<<ENDLOG; | |
251 | ||
108615fc | 252 | Int_t zero=TPC->GetParam()->GetZeroSup(); |
253 | ||
e1a32fa5 | 254 | Int_t np = gAlice->GetNtrack(); |
108615fc | 255 | Int_t *good = new Int_t[np]; |
256 | for(Int_t ii=0; ii<np; ii++) | |
257 | good[ii] = 0; | |
258 | ||
259 | if(ver==1) | |
260 | { | |
261 | if(fIsSlow) | |
262 | LOG(AliL3Log::kError,"AliL3Evaluate::DefineGoodTracks","TPC version") | |
263 | <<"TPC version "<<ver<<" does not match."<<ENDLOG; | |
264 | fMCclusterfile->cd(); | |
265 | AliTPCClustersArray carray; | |
266 | carray.Setup(fParam); | |
267 | carray.SetClusterType("AliTPCcluster"); | |
40896357 | 268 | Char_t cname[100]; |
269 | Int_t eventn = 0; | |
270 | sprintf(cname,"TreeC_TPC_%d",eventn); | |
271 | Bool_t clusterok = carray.ConnectTree(cname); | |
108615fc | 272 | if(!clusterok) |
273 | LOG(AliL3Log::kError,"AliL3Evaluate::DefineGoodTracks","Cluster Array") | |
274 | <<"Error loading clusters from rootfile"<<ENDLOG; | |
78127e35 | 275 | |
bc2f4f0e | 276 | for(Int_t i=0; i<carray.GetTree()->GetEntries(); i++) |
108615fc | 277 | { |
278 | Int_t sec,row,sl,lr; | |
279 | AliSegmentID *s = carray.LoadEntry(i); | |
280 | fParam->AdjustSectorRow(s->GetID(),sec,row); | |
494fad94 | 281 | AliL3Transform::Sector2Slice(sl,lr,sec,row); |
108615fc | 282 | |
e1a32fa5 | 283 | if(sl != slice[0]) {carray.ClearRow(sec,row); continue;} |
bc2f4f0e | 284 | if(lr < padrow[0]) {carray.ClearRow(sec,row); continue;} |
285 | if(lr > padrow[1]) {carray.ClearRow(sec,row); continue;} | |
108615fc | 286 | AliTPCClustersRow *cRow = carray.GetRow(sec,row); |
287 | for(Int_t j=0; j<cRow->GetArray()->GetEntriesFast(); j++) | |
288 | { | |
289 | AliTPCcluster *cluster=(AliTPCcluster*)(*cRow)[j]; | |
290 | Int_t lab=cluster->GetLabel(0); | |
291 | if(lab<0) continue; | |
292 | lab=TMath::Abs(lab); | |
293 | good[lab]++; | |
294 | } | |
295 | if(carray.GetRow(sec,row)) | |
296 | carray.ClearRow(sec,row); | |
297 | } | |
298 | } | |
299 | else if(ver==2) | |
300 | { | |
301 | if(!fIsSlow) | |
302 | LOG(AliL3Log::kError,"AliL3Evaluate::DefineGoodTracks","TPC version") | |
303 | <<"TPC version "<<ver<<" does not match."<<ENDLOG; | |
304 | Int_t *count = new Int_t[np]; //np number of particles. | |
305 | Int_t i; | |
355debe1 | 306 | Float_t xyz[3]; |
108615fc | 307 | for (i=0; i<np; i++) count[i]=0; |
e1a32fa5 | 308 | for(Int_t sl=slice[0]; sl<=slice[1]; sl++) |
309 | { | |
310 | for (i=padrow[0]; i<=padrow[1]; i++) { | |
311 | Int_t index = fRowid[sl][i]; | |
312 | if (!fDigitsTree->GetEvent(index)) continue; | |
313 | Int_t sec,row; | |
314 | fParam->AdjustSectorRow(fDigits->GetID(),sec,row); | |
315 | fDigits->First(); | |
316 | do { | |
317 | Int_t it=fDigits->CurrentRow(), ip=fDigits->CurrentColumn(); | |
318 | Short_t dig = fDigits->GetDigit(it,ip); | |
355debe1 | 319 | |
320 | if(dig<=fParam->GetZeroSup()) continue; | |
321 | if(it < fParam->GetMaxTBin()-1 && it > 0) | |
322 | if(fDigits->GetDigit(it+1,ip) <= fParam->GetZeroSup() | |
323 | && fDigits->GetDigit(it-1,ip) <= fParam->GetZeroSup()) | |
324 | continue; | |
325 | ||
494fad94 | 326 | AliL3Transform::Raw2Local(xyz,sec,row,ip,it); |
355debe1 | 327 | if(fParam->GetPadRowRadii(sec,row)<230./250.*fabs(xyz[2])) |
328 | continue; | |
329 | ||
e1a32fa5 | 330 | Int_t idx0=fDigits->GetTrackID(it,ip,0); |
331 | Int_t idx1=fDigits->GetTrackID(it,ip,1); | |
332 | Int_t idx2=fDigits->GetTrackID(it,ip,2); | |
e170e0f9 | 333 | |
e1a32fa5 | 334 | if (idx0>=0 && dig>=zero) count[idx0]+=1; |
335 | if (idx1>=0 && dig>=zero) count[idx1]+=1; | |
336 | if (idx2>=0 && dig>=zero) count[idx2]+=1; | |
337 | } while (fDigits->Next()); | |
338 | ||
339 | for (Int_t j=0; j<np; j++) | |
340 | { | |
341 | if (count[j]>1) //at least two digits at this padrow | |
342 | good[j]++; | |
343 | ||
344 | count[j]=0; | |
345 | } | |
108615fc | 346 | } |
108615fc | 347 | } |
108615fc | 348 | delete[] count; |
349 | } | |
e1a32fa5 | 350 | |
108615fc | 351 | else |
352 | { | |
353 | LOG(AliL3Log::kError,"AliL3Evaluation::FillEffHistos","TPC version") | |
354 | <<"No valid TPC version found"<<ENDLOG; | |
e1a32fa5 | 355 | return; |
108615fc | 356 | } |
357 | ||
e1a32fa5 | 358 | |
359 | //The following code has been taken from offlinemacro->AliTPCComparison.C | |
360 | ||
361 | TTree *TH=gAlice->TreeH(); | |
362 | Int_t npart=(Int_t)TH->GetEntries(); | |
e1a32fa5 | 363 | Int_t max = 15000; |
364 | while (npart--) { | |
365 | AliTPChit *hit0=0; | |
366 | ||
40896357 | 367 | TPC->ResetHits(); |
368 | TH->GetEvent(npart); | |
369 | AliTPChit * hit = (AliTPChit*) TPC->FirstHit(-1); | |
370 | while (hit){ | |
371 | if (hit->fQ==0.) break; | |
372 | hit = (AliTPChit*) TPC->NextHit(); | |
373 | } | |
374 | if (hit) { | |
375 | hit0 = new AliTPChit(*hit); //Make copy of hit | |
376 | hit = hit0; | |
377 | } | |
378 | else continue; | |
379 | AliTPChit *hit1=(AliTPChit*)TPC->NextHit(); | |
380 | if (hit1==0) continue; | |
381 | if (hit1->fQ != 0.) continue; | |
382 | Int_t i=hit->Track(); | |
383 | TParticle *p = (TParticle*)gAlice->Particle(i); | |
384 | ||
385 | //printf("Checking particle %d with code %d\n",i,p->GetPdgCode()); | |
386 | if (p->GetFirstMother()>=0) continue; //secondary particle | |
355debe1 | 387 | if (good[i] < good_number || good[i]>176) continue; |
40896357 | 388 | if (p->Pt()<fMinGoodPt) continue; |
389 | if (TMath::Abs(p->Pz()/p->Pt())>0.999) continue; | |
390 | printf("Found good particle %d, nHits %d\n",i,good[i]); | |
391 | ||
392 | fGoodTracks[fGoodGen].label=i; | |
393 | fGoodTracks[fGoodGen].code=p->GetPdgCode(); | |
394 | //**** px py pz - in global coordinate system, x y z - in local ! | |
395 | fGoodTracks[fGoodGen].px=hit->X(); fGoodTracks[fGoodGen].py=hit->Y(); fGoodTracks[fGoodGen].pz=hit->Z(); | |
396 | fGoodTracks[fGoodGen].pt = p->Pt(); | |
397 | fGoodGen++; | |
398 | //nt++; | |
399 | if (hit0) delete hit0; | |
400 | if (fGoodGen==max) {cerr<<"Too many good tracks !n"; break;} | |
401 | } | |
e170e0f9 | 402 | |
108615fc | 403 | delete [] good; |
40896357 | 404 | |
405 | LOG(AliL3Log::kInformational,"AliL3Evaluate::DefineGoodParticles","Eval") | |
406 | <<AliL3Log::kDec<<"Found "<<fGoodGen<<"good tracks"<<ENDLOG; | |
407 | ||
408 | ofstream out(fname); | |
409 | if(out) | |
410 | { | |
411 | for (Int_t ngd=0; ngd<fGoodGen; ngd++) | |
412 | out<<fGoodTracks[ngd].label<<' '<<fGoodTracks[ngd].code<<' '<< | |
413 | fGoodTracks[ngd].px<<' '<<fGoodTracks[ngd].py<<' '<<fGoodTracks[ngd].pz<<' '<< | |
414 | fGoodTracks[ngd].pt<<endl; | |
415 | ||
416 | } | |
417 | else | |
418 | LOG(AliL3Log::kError,"AliL3Evaluate::DefineGoodParticles","file") | |
419 | <<"Can not open file containing good tracks"<<ENDLOG; | |
420 | ||
421 | out.close(); | |
422 | ||
108615fc | 423 | } |
424 | ||
425 | void AliL3Evaluate::EvaluatePatch(Int_t slice,Int_t patch,Int_t min_points,Int_t good_number) | |
426 | { | |
427 | //Make efficiency plots for tracking on patch level (before any merging). | |
428 | ||
40896357 | 429 | Int_t row[6][2] = {{ 0, 45},{46,77},{78,109},{110,141},{142,175}}; |
e1a32fa5 | 430 | Int_t sl[2] ={slice,slice}; |
431 | DefineGoodTracks(sl,row[patch],good_number); | |
108615fc | 432 | SetMinPoints(min_points); |
433 | AssignIDs(); | |
bc2f4f0e | 434 | CreateHistos(); |
e1a32fa5 | 435 | FillEffHistos(); |
bc2f4f0e | 436 | CalcEffHistos(); |
108615fc | 437 | } |
438 | ||
439 | void AliL3Evaluate::EvaluateSlice(Int_t slice,Int_t min_points,Int_t good_number) | |
440 | { | |
441 | //Make efficiency plots for tracking on a slice (after merging). | |
442 | //min_points = minimum points on track to be considered for evaluation | |
443 | //good_number = minimum hits (padrows) produced by simulated track for consideration. | |
444 | ||
ae97a0b9 | 445 | Int_t row[2] = {0,175}; |
e1a32fa5 | 446 | Int_t sl[2] ={slice,slice}; |
447 | DefineGoodTracks(sl,row,good_number); | |
23908b9b | 448 | |
108615fc | 449 | SetMinPoints(min_points); |
23908b9b | 450 | |
108615fc | 451 | AssignIDs(); |
bc2f4f0e | 452 | CreateHistos(); |
e1a32fa5 | 453 | FillEffHistos(); |
bc2f4f0e | 454 | CalcEffHistos(); |
108615fc | 455 | } |
456 | ||
40896357 | 457 | void AliL3Evaluate::EvaluateGlobal(Int_t min_points,Int_t good_number,Char_t *fname) |
108615fc | 458 | { |
459 | //Make efficiency plots for tracking on several slices. | |
bc2f4f0e | 460 | |
ae97a0b9 | 461 | Int_t row[2] = {0,175}; |
bc2f4f0e | 462 | SetMinPoints(min_points); |
e1a32fa5 | 463 | Int_t slice[2] = {fMinSlice,fMaxSlice}; |
40896357 | 464 | DefineGoodTracks(slice,row,good_number,fname); |
bc2f4f0e | 465 | AssignIDs(); |
355debe1 | 466 | CreateHistos(5,0,2); |
40896357 | 467 | printf("filling histos\n"); |
e1a32fa5 | 468 | FillEffHistos(); |
40896357 | 469 | printf("done fillling\n"); |
bc2f4f0e | 470 | CalcEffHistos(); |
108615fc | 471 | } |
472 | ||
108615fc | 473 | void AliL3Evaluate::AssignIDs() |
474 | { | |
475 | //Assign MC id to the tracks. | |
476 | ||
108615fc | 477 | fTracks->QSort(); |
478 | LOG(AliL3Log::kDebug,"AliL3Evaluate::AssignIDs","Track Loop") | |
479 | <<"Assigning MC id to the found tracks...."<<ENDLOG; | |
480 | for(Int_t i=0; i<fTracks->GetNTracks(); i++) | |
481 | { | |
482 | AliL3Track *track = (AliL3Track*)fTracks->GetCheckedTrack(i); | |
c0217812 | 483 | if(!track) continue; |
108615fc | 484 | if(track->GetNumberOfPoints() < fMinPointsOnTrack) break; |
23908b9b | 485 | |
23908b9b | 486 | fGoodFound++; |
c0217812 | 487 | Int_t tID = GetMCTrackLabel(track); |
108615fc | 488 | track->SetMCid(tID); |
e170e0f9 | 489 | printf("track %i id %d nHits %d\n",i,tID,track->GetNumberOfPoints()); |
108615fc | 490 | } |
108615fc | 491 | } |
492 | ||
493 | ||
494 | struct S {Int_t lab; Int_t max;}; | |
c0217812 | 495 | Int_t AliL3Evaluate::GetMCTrackLabel(AliL3Track *track){ |
108615fc | 496 | //Returns the MCtrackID of the belonging clusters. |
497 | //If MCLabel < 0, means that track is fake. | |
498 | //Fake track means that more than 10 percent of clusters are assigned incorrectly. | |
494fad94 | 499 | |
500 | #ifdef do_mc | |
108615fc | 501 | Int_t num_of_clusters = track->GetNumberOfPoints(); |
502 | S *s=new S[num_of_clusters]; | |
503 | Int_t i; | |
504 | for (i=0; i<num_of_clusters; i++) s[i].lab=s[i].max=0; | |
505 | UInt_t *hitnum = track->GetHitNumbers(); | |
506 | UInt_t id; | |
108615fc | 507 | |
355debe1 | 508 | //Int_t **trackID = GetClusterIDs(track); |
108615fc | 509 | |
510 | Int_t lab=123456789; | |
511 | for (i=0; i<num_of_clusters; i++) | |
512 | { | |
513 | //Tricks to get the clusters belonging to this track: | |
514 | id = hitnum[i]; | |
515 | Int_t slice = (id>>25) & 0x7f; | |
516 | Int_t patch = (id>>22) & 0x7; | |
517 | UInt_t pos = id&0x3fffff; | |
518 | ||
519 | AliL3SpacePointData *points = fClusters[slice][patch]; | |
c0217812 | 520 | if(!points) continue; |
108615fc | 521 | if(pos>=fNcl[slice][patch]) |
522 | { | |
523 | LOG(AliL3Log::kError,"AliL3Evaluate::GetMCTrackLabel","Clusterarray") | |
524 | <<AliL3Log::kDec<<"ERROR"<<ENDLOG; | |
525 | continue; | |
526 | } | |
527 | ||
528 | //Get the label of the cluster: | |
355debe1 | 529 | |
530 | lab=abs(points[pos].fTrackID[0]); | |
108615fc | 531 | Int_t j; |
532 | for (j=0; j<num_of_clusters; j++) | |
533 | if (s[j].lab==lab || s[j].max==0) break; | |
534 | s[j].lab=lab; | |
535 | s[j].max++; | |
536 | } | |
537 | ||
538 | Int_t max=0; | |
539 | for (i=0; i<num_of_clusters; i++) | |
540 | if (s[i].max>max) {max=s[i].max; lab=s[i].lab;} | |
541 | ||
542 | delete[] s; | |
543 | ||
544 | for (i=0; i<num_of_clusters; i++) | |
545 | { | |
546 | id = hitnum[i]; | |
547 | Int_t slice = (id>>25) & 0x7f; | |
548 | Int_t patch = (id>>22) & 0x7; | |
549 | UInt_t pos = id&0x3fffff; | |
550 | ||
551 | AliL3SpacePointData *points = fClusters[slice][patch]; | |
c0217812 | 552 | if(!points) continue; |
108615fc | 553 | if(pos>=fNcl[slice][patch]) |
554 | { | |
555 | LOG(AliL3Log::kError,"AliL3Evaluate::GetMCTrackLabel","Clusterarray") | |
556 | <<AliL3Log::kDec<<"ERROR"<<ENDLOG; | |
557 | continue; | |
558 | } | |
559 | ||
355debe1 | 560 | if (abs(points[pos].fTrackID[1]) == lab || |
561 | abs(points[pos].fTrackID[2]) == lab ) max++; | |
108615fc | 562 | } |
563 | ||
564 | //check if more than 10% of the clusters are incorrectly assigned (fake track): | |
565 | if (1.-Float_t(max)/num_of_clusters > 0.10) | |
566 | { | |
567 | return -lab; | |
568 | } | |
569 | ||
108615fc | 570 | return lab; |
494fad94 | 571 | #else //If we are running with mc_ids or not |
572 | return 0; | |
573 | #endif | |
574 | ||
108615fc | 575 | } |
576 | ||
577 | ||
c0217812 | 578 | Int_t **AliL3Evaluate::GetClusterIDs(AliL3Track *track) |
108615fc | 579 | { |
580 | //Return the MC information of all clusters belonging to track. | |
c0217812 | 581 | |
108615fc | 582 | Int_t num_of_clusters = track->GetNumberOfPoints(); |
583 | Int_t **trackID = new Int_t*[num_of_clusters]; | |
584 | ||
585 | UInt_t *hitnum = track->GetHitNumbers(); | |
586 | UInt_t id; | |
108615fc | 587 | |
588 | Float_t xyz[3]; | |
c0217812 | 589 | Int_t padrow; |
108615fc | 590 | for(Int_t i=0; i<num_of_clusters; i++) |
591 | { | |
592 | id = hitnum[i]; | |
593 | Int_t slice = (id>>25) & 0x7f; | |
594 | Int_t patch = (id>>22) & 0x7; | |
595 | UInt_t pos = id&0x3fffff; | |
596 | ||
597 | AliL3SpacePointData *points = fClusters[slice][patch]; | |
598 | ||
599 | if(!points) | |
600 | { | |
601 | LOG(AliL3Log::kError,"AliL3Evaluate::GetClusterIDs","Clusterarray") | |
602 | <<"No points at slice "<<slice<<" patch "<<patch<<" pos "<<pos<<ENDLOG; | |
603 | continue; | |
604 | } | |
605 | if(pos>=fNcl[slice][patch]) | |
606 | { | |
607 | LOG(AliL3Log::kError,"AliL3Evaluate::GetClusterIDs","Clusterarray") | |
608 | <<AliL3Log::kDec<<"ERROR"<<ENDLOG; | |
609 | continue; | |
610 | } | |
611 | ||
612 | xyz[0] = points[pos].fX; | |
613 | xyz[1] = points[pos].fY; | |
614 | xyz[2] = points[pos].fZ; | |
615 | //sector = points[pos].fSector; | |
616 | padrow = points[pos].fPadRow; | |
617 | Int_t se,ro; | |
494fad94 | 618 | AliL3Transform::Slice2Sector(slice,padrow,se,ro); |
619 | AliL3Transform::Global2Raw(xyz,se,ro); | |
108615fc | 620 | |
621 | if(fIsSlow) | |
622 | { | |
623 | Int_t p = fRowid[slice][padrow]; | |
108615fc | 624 | if(!fDigitsTree->GetEvent(p)) |
625 | LOG(AliL3Log::kError,"AliL3Evaluate::GetClusterIDs","Digits Tree") | |
626 | <<"Error reading digits tree"<<ENDLOG; | |
627 | ||
628 | trackID[i] = new Int_t[3]; | |
e170e0f9 | 629 | trackID[i][0] = fDigits->GetTrackID((Int_t)rint(xyz[2]),(Int_t)rint(xyz[1]),0); |
630 | trackID[i][1] = fDigits->GetTrackID((Int_t)rint(xyz[2]),(Int_t)rint(xyz[1]),1); | |
631 | trackID[i][2] = fDigits->GetTrackID((Int_t)rint(xyz[2]),(Int_t)rint(xyz[1]),2); | |
632 | //if(trackID[i][0]==6 || trackID[i][0]==32) | |
633 | //printf("trackID %d, padrow %d pad %d time %d\n",fDigits->GetTrackID((Int_t)rint(xyz[2]),(Int_t)rint(xyz[1]),0),padrow,(int)rint(xyz[1]),(int)rint(xyz[2])); | |
634 | /*if(trackID[i][0]<0) | |
635 | { | |
636 | ||
637 | printf("trackID %d, padrow %d pad %d time %d\n",trackID[i][0],padrow,(int)rint(xyz[1]),(int)rint(xyz[2])); | |
638 | printf("on the side %d %d %d %d\n",fDigits->GetTrackID(((int)rint(xyz[2])-1),((int)rint(xyz[1])),0),fDigits->GetTrackID(((int)rint(xyz[2])+1),((int)rint(xyz[1])),0),fDigits->GetTrackID(((int)rint(xyz[2])),((int)rint(xyz[1])-1),0),fDigits->GetTrackID(((int)rint(xyz[2])),((int)rint(xyz[1])+1),0)); | |
639 | }*/ | |
108615fc | 640 | } |
641 | else | |
642 | { | |
643 | Int_t tmp_pid=0; | |
c0217812 | 644 | for(Int_t ii=0; ii<fNFastPoints; ii++) |
108615fc | 645 | { |
c0217812 | 646 | tmp_pid = fMcId[ii]; |
647 | if(fMcIndex[ii] == id) break; | |
108615fc | 648 | } |
649 | trackID[i] = new Int_t[3]; | |
650 | trackID[i][0] = tmp_pid; | |
651 | trackID[i][1] = -1; | |
652 | trackID[i][2] = -1; | |
653 | } | |
654 | } | |
e170e0f9 | 655 | |
108615fc | 656 | return trackID; |
657 | } | |
658 | ||
c0217812 | 659 | void AliL3Evaluate::GetFastClusterIDs(Char_t *path) |
108615fc | 660 | { |
661 | //Get the MC id of space points in case of using the fast simulator. | |
c0217812 | 662 | char fname[256]; |
663 | sprintf(fname,"%s/point_mc.dat",path); | |
664 | FILE *infile = fopen(fname,"r"); | |
665 | if(!infile) return; | |
108615fc | 666 | Int_t hitid,hitmc,i; |
667 | ||
668 | for(i=0; ; i++) | |
669 | if(fscanf(infile,"%d %d",&hitid,&hitmc)==EOF) break; | |
108615fc | 670 | rewind(infile); |
c0217812 | 671 | fNFastPoints = i; |
672 | fMcId = new Int_t[fNFastPoints]; | |
673 | fMcIndex = new UInt_t[fNFastPoints]; | |
108615fc | 674 | |
c0217812 | 675 | for(i=0; i<fNFastPoints; i++) |
108615fc | 676 | { |
677 | if(fscanf(infile,"%d %d",&hitid,&hitmc)==EOF) break; | |
c0217812 | 678 | fMcId[i] = hitmc; |
679 | fMcIndex[i] = hitid; | |
108615fc | 680 | } |
681 | fclose(infile); | |
c0217812 | 682 | } |
683 | ||
684 | void AliL3Evaluate::CreateHistos(Int_t nbin,Int_t xlow,Int_t xup) | |
685 | { | |
686 | //Create the histograms | |
687 | ||
40896357 | 688 | LOG(AliL3Log::kInformational,"AliL3Evaluate::CreateHistos","Allocating") |
689 | <<"Creating histograms..."<<ENDLOG; | |
690 | ||
1f79afc0 | 691 | fNtuppel = new TNtuple("fNtuppel","Pt resolution","pt_gen:pt_found:nHits"); |
692 | ||
c0217812 | 693 | fPtRes = new TH1F("fPtRes","Relative Pt resolution",30,-10.,10.); |
694 | fNGoodTracksPt = new TH1F("fNGoodTracksPt","Good tracks vs pt",nbin,xlow,xup); | |
695 | fNFoundTracksPt = new TH1F("fNFoundTracksPt","Found tracks vs pt",nbin,xlow,xup); | |
696 | fNFakeTracksPt = new TH1F("fNFakeTracksPt","Fake tracks vs pt",nbin,xlow,xup); | |
697 | fTrackEffPt = new TH1F("fTrackEffPt","Tracking efficiency vs pt",nbin,xlow,xup); | |
698 | fFakeTrackEffPt = new TH1F("fFakeTrackEffPt","Efficiency for fake tracks vs pt",nbin,xlow,xup); | |
699 | ||
700 | fNGoodTracksEta = new TH1F("fNGoodTracksEta","Good tracks vs eta",20,-50,50); | |
701 | fNFoundTracksEta = new TH1F("fNFoundTracksEta","Found tracks vs eta",20,-50,50); | |
702 | fNFakeTracksEta = new TH1F("fNFakeTracksEta","Fake tracks vs eta",20,-50,50); | |
703 | fTrackEffEta = new TH1F("fTrackEffEta","Tracking efficienct vs eta",20,-50,50); | |
704 | fFakeTrackEffEta = new TH1F("fFakeTrackEffEta","Efficiency for fake tracks vs eta",20,-50,50); | |
40896357 | 705 | printf("finished creating histos\n"); |
c0217812 | 706 | } |
355debe1 | 707 | /* |
e1a32fa5 | 708 | void AliL3Evaluate::FillEffHistos() |
c0217812 | 709 | { |
710 | //Fill the efficiency histograms. | |
355debe1 | 711 | |
e1a32fa5 | 712 | for(Int_t i=0; i<fGoodGen; i++) |
c0217812 | 713 | { |
e1a32fa5 | 714 | Double_t ptg=fGoodTracks[i].pt,pzg=fGoodTracks[i].pz; |
c0217812 | 715 | Float_t dipangle=TMath::ATan2(pzg,ptg)*180./TMath::Pi(); |
355debe1 | 716 | //printf("filling particle with pt %f and dipangle %f\n",ptg,dipangle); |
c0217812 | 717 | fNGoodTracksPt->Fill(ptg); |
718 | fNGoodTracksEta->Fill(dipangle); | |
719 | Int_t found = 0; | |
720 | for(Int_t k=0; k<fTracks->GetNTracks(); k++) | |
721 | { | |
722 | AliL3Track *track = fTracks->GetCheckedTrack(k); | |
723 | if(!track) continue; | |
724 | Int_t nHits = track->GetNumberOfPoints(); | |
725 | if(nHits < fMinPointsOnTrack) break; | |
726 | ||
727 | Int_t tracklabel; | |
728 | tracklabel = track->GetMCid(); | |
355debe1 | 729 | //printf("evaluating track id %d\n",tracklabel); |
e1a32fa5 | 730 | if(TMath::Abs(tracklabel) != fGoodTracks[i].label) continue; |
c0217812 | 731 | found=1; |
e1a32fa5 | 732 | if(tracklabel == fGoodTracks[i].label) {fNFoundTracksPt->Fill(ptg); fNFoundTracksEta->Fill(dipangle);} |
c0217812 | 733 | else {fNFakeTracksPt->Fill(ptg); fNFakeTracksEta->Fill(dipangle);} |
734 | Float_t pt=track->GetPt(); | |
735 | fPtRes->Fill((pt-ptg)/ptg*100.); | |
1f79afc0 | 736 | fNtuppel->Fill(ptg,pt,nHits); |
c0217812 | 737 | break; |
738 | ||
739 | } | |
740 | } | |
741 | } | |
355debe1 | 742 | */ |
743 | void AliL3Evaluate::FillEffHistos() | |
744 | { | |
745 | //Fill the efficiency histograms. | |
746 | ||
747 | cout<<endl<<"Note: Doing NAIVE evaluation "<<endl; | |
748 | for(Int_t i=0; i<fGoodGen; i++) | |
749 | { | |
750 | Double_t ptg=fGoodTracks[i].pt,pzg=fGoodTracks[i].pz; | |
751 | Float_t dipangle=TMath::ATan2(pzg,ptg)*180./TMath::Pi(); | |
752 | //printf("filling particle with pt %f and dipangle %f\n",ptg,dipangle); | |
753 | fNGoodTracksPt->Fill(ptg); | |
754 | fNGoodTracksEta->Fill(dipangle); | |
755 | ||
756 | } | |
757 | ||
758 | for(Int_t k=0; k<fTracks->GetNTracks(); k++) | |
759 | { | |
760 | AliL3Track *track = fTracks->GetCheckedTrack(k); | |
761 | if(!track) continue; | |
762 | Int_t nHits = track->GetNumberOfPoints(); | |
763 | if(nHits < fMinPointsOnTrack) break; | |
764 | if(track->GetPt()<fMinGoodPt) continue; | |
765 | if(fabs(track->GetPseudoRapidity())>0.9) continue; | |
766 | ||
767 | fNFoundTracksPt->Fill(track->GetPt()); fNFoundTracksEta->Fill(track->GetPseudoRapidity()); | |
768 | //Float_t pt=track->GetPt(); | |
769 | //fPtRes->Fill((pt-ptg)/ptg*100.); | |
770 | //fNtuppel->Fill(ptg,pt,nHits); | |
771 | ||
772 | } | |
773 | } | |
c0217812 | 774 | |
775 | void AliL3Evaluate::CalcEffHistos(){ | |
776 | ||
777 | Stat_t ngood=fNGoodTracksPt->GetEntries(); | |
778 | Stat_t nfound=fNFoundTracksPt->GetEntries(); | |
779 | Stat_t nfake=fNFakeTracksPt->GetEntries(); | |
780 | ||
781 | LOG(AliL3Log::kInformational,"AliL3Evaluate::FillEffHistos","Efficiency") | |
782 | <<AliL3Log::kDec<<"There was "<<ngood<<" generated good tracks"<<ENDLOG; | |
783 | LOG(AliL3Log::kInformational,"AliL3Evaluate::FillEffHistos","Efficiency") | |
784 | <<AliL3Log::kDec<<"Found "<<nfound<<" tracks"<<ENDLOG; | |
785 | LOG(AliL3Log::kInformational,"AliL3Evaluate::FillEffHistos","Efficiency") | |
786 | <<AliL3Log::kDec<<"Integral efficiency is about "<<nfound/ngood*100<<ENDLOG; | |
787 | LOG(AliL3Log::kInformational,"AliL3Evaluate::FillEffHistos","Efficiency") | |
788 | <<AliL3Log::kDec<<"Fake tracks relative is about "<<nfake/ngood*100<<ENDLOG; | |
789 | ||
355debe1 | 790 | LOG(AliL3Log::kInformational,"AliL3Evaluate::FillEffHistos","Efficiency") |
791 | <<AliL3Log::kDec<<"Naive efficiency "<<(Double_t)fGoodFound/(Double_t)fGoodGen<<ENDLOG; | |
792 | ||
793 | ||
c0217812 | 794 | fNFoundTracksPt->Sumw2(); fNGoodTracksPt->Sumw2(); |
795 | fTrackEffPt->Divide(fNFoundTracksPt,fNGoodTracksPt,1,1.,"b"); | |
796 | fFakeTrackEffPt->Divide(fNFakeTracksPt,fNGoodTracksPt,1,1.,"b"); | |
797 | fTrackEffPt->SetMaximum(1.4); | |
798 | fTrackEffPt->SetXTitle("P_{T} [GeV]"); | |
799 | fTrackEffPt->SetLineWidth(2); | |
800 | fFakeTrackEffPt->SetFillStyle(3013); | |
801 | fTrackEffPt->SetLineColor(4); | |
802 | fFakeTrackEffPt->SetFillColor(2); | |
803 | ||
804 | fNFoundTracksEta->Sumw2(); fNGoodTracksEta->Sumw2(); | |
805 | fTrackEffEta->Divide(fNFoundTracksEta,fNGoodTracksEta,1,1.,"b"); | |
806 | fFakeTrackEffEta->Divide(fNFakeTracksEta,fNGoodTracksEta,1,1.,"b"); | |
807 | fTrackEffEta->SetMaximum(1.4); | |
808 | fTrackEffEta->SetXTitle("#lambda [degrees]"); | |
809 | fTrackEffEta->SetLineWidth(2); | |
810 | fFakeTrackEffEta->SetFillStyle(3013); | |
811 | fTrackEffEta->SetLineColor(4); | |
812 | fFakeTrackEffEta->SetFillColor(2); | |
813 | ||
108615fc | 814 | } |
815 | ||
816 | void AliL3Evaluate::Write2File(Char_t *outputfile) | |
817 | { | |
818 | //Write histograms to file: | |
819 | ||
820 | TFile *of = new TFile(outputfile,"RECREATE"); | |
821 | if(!of->IsOpen()) | |
822 | { | |
823 | LOG(AliL3Log::kError,"AliL3Evaluate::Write2File","File Open") | |
824 | <<"Problems opening rootfile"<<ENDLOG; | |
825 | return; | |
826 | } | |
827 | ||
828 | of->cd(); | |
1f79afc0 | 829 | fNtuppel->Write(); |
108615fc | 830 | fPtRes->Write(); |
831 | fNGoodTracksPt->Write(); | |
832 | fNFoundTracksPt->Write(); | |
833 | fNFakeTracksPt->Write(); | |
834 | fTrackEffPt->Write(); | |
835 | fFakeTrackEffPt->Write(); | |
836 | fNGoodTracksEta->Write(); | |
837 | fNFoundTracksEta->Write(); | |
838 | fNFakeTracksEta->Write(); | |
839 | fTrackEffEta->Write(); | |
840 | fFakeTrackEffEta->Write(); | |
841 | ||
842 | of->Close(); | |
843 | delete of; | |
844 | ||
845 | } | |
846 | ||
1f79afc0 | 847 | TNtuple *AliL3Evaluate::CalculateResiduals() |
848 | { | |
849 | ||
850 | TNtuple *ntuppel=new TNtuple("ntuppel","Residuals","residual_trans:residual_long:zHit:pt:dipangle:beta:padrow:nHits"); | |
78127e35 | 851 | |
1f79afc0 | 852 | for(int f=fMinSlice; f<=fMaxSlice; f++) |
853 | { | |
854 | AliL3FileHandler *tfile = new AliL3FileHandler(); | |
855 | char fname[256]; | |
856 | sprintf(fname,"tracks_tr_%d_0.raw",f); | |
857 | if(!tfile->SetBinaryInput(fname)){ | |
858 | LOG(AliL3Log::kError,"AliL3Evaluation::Setup","File Open") | |
859 | <<"Inputfile "<<fname<<" does not exist"<<ENDLOG; | |
860 | return 0; | |
861 | } | |
862 | fTracks = new AliL3TrackArray(); | |
863 | tfile->Binary2TrackArray(fTracks); | |
864 | tfile->CloseBinaryInput(); | |
865 | delete tfile; | |
78127e35 | 866 | printf("Looking in slice %d\n",f); |
1f79afc0 | 867 | for(Int_t i=0; i<fTracks->GetNTracks(); i++) |
868 | { | |
869 | ||
870 | AliL3Track *track = (AliL3Track*)fTracks->GetCheckedTrack(i); | |
871 | if(!track) continue; | |
872 | ||
873 | track->CalculateHelix(); | |
874 | UInt_t *hitnum = track->GetHitNumbers(); | |
875 | UInt_t id; | |
876 | ||
877 | Float_t xyz[3]; | |
878 | Int_t padrow; | |
78127e35 | 879 | for(Int_t j=0; j<track->GetNumberOfPoints()-1; j++) |
1f79afc0 | 880 | { |
881 | id = hitnum[j]; | |
882 | Int_t slice = (id>>25) & 0x7f; | |
883 | Int_t patch = (id>>22) & 0x7; | |
884 | UInt_t pos = id&0x3fffff; | |
885 | ||
78127e35 | 886 | //if(slice!=1) continue; |
887 | ||
1f79afc0 | 888 | AliL3SpacePointData *points = fClusters[slice][patch]; |
889 | ||
890 | if(!points) | |
891 | { | |
892 | LOG(AliL3Log::kError,"AliL3Evaluate::CalculateResiduals","Clusterarray") | |
893 | <<"No points at slice "<<slice<<" patch "<<patch<<" pos "<<pos<<ENDLOG; | |
894 | continue; | |
895 | } | |
896 | if(pos>=fNcl[slice][patch]) | |
897 | { | |
898 | LOG(AliL3Log::kError,"AliL3Evaluate::CalculateResiduals","Clusterarray") | |
899 | <<AliL3Log::kDec<<"ERROR"<<ENDLOG; | |
900 | continue; | |
901 | } | |
902 | ||
903 | xyz[0] = points[pos].fX; | |
904 | xyz[1] = points[pos].fY; | |
905 | xyz[2] = points[pos].fZ; | |
906 | padrow = points[pos].fPadRow; | |
494fad94 | 907 | //AliL3Transform::Global2Local(xyz,slice); |
1f79afc0 | 908 | |
909 | Float_t xyz_cross[3]; | |
910 | track->GetCrossingPoint(padrow,xyz_cross); | |
e1a32fa5 | 911 | Double_t beta = track->GetCrossingAngle(padrow); |
1f79afc0 | 912 | |
913 | Double_t yres = xyz_cross[1] - xyz[1]; | |
914 | Double_t zres = xyz_cross[2] - xyz[2]; | |
915 | ||
916 | Double_t dipangle = atan(track->GetTgl()); | |
917 | ntuppel->Fill(yres,zres,xyz_cross[2],track->GetPt(),dipangle,beta,padrow,track->GetNumberOfPoints()); | |
918 | ||
919 | } | |
920 | } | |
921 | if(fTracks) | |
922 | delete fTracks; | |
923 | } | |
924 | return ntuppel; | |
925 | } | |
926 | ||
e1a32fa5 | 927 | TNtuple *AliL3Evaluate::EvaluatePoints(Char_t *rootfile) |
78127e35 | 928 | { |
e1a32fa5 | 929 | //Compare points to the exact crossing points of track and padrows. |
1b76fd18 | 930 | //The input file to this function, contains the exact clusters calculated |
931 | //in AliTPC::Hits2ExactClusters. | |
e1a32fa5 | 932 | |
355debe1 | 933 | cout<<"Evaluating points"<<endl; |
e1a32fa5 | 934 | TNtuple *ntuppel = new TNtuple("ntuppel","residuals","slice:padrow:resy:resz:zHit:pt"); |
78127e35 | 935 | |
355debe1 | 936 | TFile *exfile = TFile::Open(rootfile); |
937 | if(!exfile) | |
938 | { | |
939 | cerr<<"Error opening rootfile "<<rootfile<<endl; | |
940 | return 0; | |
941 | } | |
942 | ||
e1a32fa5 | 943 | AliTPCParam *param = (AliTPCParam*)exfile->Get("75x40_100x60"); |
944 | ||
945 | //Get the exact clusters from file: | |
946 | AliTPCClustersArray *arr = new AliTPCClustersArray; | |
947 | arr->Setup(param); | |
948 | arr->SetClusterType("AliComplexCluster"); | |
949 | char treeName[500]; | |
950 | sprintf(treeName,"TreeCExact_%s",param->GetTitle()); | |
294ee877 | 951 | Bool_t clusterok = arr->ConnectTree(treeName);//Segment Tree (for offline clusters) |
e1a32fa5 | 952 | if(!clusterok) {printf("AliL3Evaluate::EvaluatePoints : Error in clusterloading\n"); return 0;} |
953 | ||
355debe1 | 954 | cout<<"Entering loop with "<<(Int_t)arr->GetTree()->GetEntries()<<endl; |
e1a32fa5 | 955 | for(Int_t i=0; i<arr->GetTree()->GetEntries(); i++) |
78127e35 | 956 | { |
e1a32fa5 | 957 | //Get the exact clusters for this row: |
958 | Int_t cursec,currow; | |
959 | AliSegmentID *s = arr->LoadEntry(i); | |
960 | param->AdjustSectorRow(s->GetID(),cursec,currow); | |
78127e35 | 961 | |
e1a32fa5 | 962 | AliTPCClustersRow *ro = (AliTPCClustersRow *)arr->GetRow(cursec,currow); |
963 | TClonesArray *clusters = ro->GetArray(); | |
964 | int num_of_offline=clusters->GetEntriesFast(); | |
78127e35 | 965 | |
e1a32fa5 | 966 | //Get the found clusters: |
967 | Int_t slice,padrow; | |
494fad94 | 968 | AliL3Transform::Sector2Slice(slice,padrow,cursec,currow); |
e1a32fa5 | 969 | if(slice<fMinSlice || slice>fMaxSlice) continue; |
970 | AliL3SpacePointData *points = fClusters[slice][0]; | |
1b76fd18 | 971 | |
972 | Int_t index = fRowid[slice][padrow]; | |
973 | if(!fDigitsTree->GetEvent(index)) | |
974 | printf("AliL3Evaluate::EvaluatePoints : ERROR IN DIGITSTREE\n"); | |
294ee877 | 975 | printf("Checking slice %d padrow %d with %d clusters\n",slice,padrow,num_of_offline); |
1b76fd18 | 976 | |
e1a32fa5 | 977 | for(UInt_t c=0; c<fNcl[slice][0]; c++) |
78127e35 | 978 | { |
e1a32fa5 | 979 | if(points[c].fPadRow!=padrow) continue; |
e1a32fa5 | 980 | for(Int_t m=0; m<num_of_offline; m++) |
78127e35 | 981 | { |
e1a32fa5 | 982 | AliComplexCluster *cluster = (AliComplexCluster *)clusters->UncheckedAt(m); |
983 | Int_t mcId = cluster->fTracks[0]; | |
294ee877 | 984 | //Int_t mcId = cluster->GetLabel(0); |
985 | if(mcId <0) continue; | |
e1a32fa5 | 986 | TParticle *part = gAlice->Particle(mcId); |
294ee877 | 987 | |
e1a32fa5 | 988 | Float_t xyz_cl[3] = {points[c].fX,points[c].fY,points[c].fZ}; |
294ee877 | 989 | Float_t xyz_ex[3]; |
494fad94 | 990 | AliL3Transform::Global2Raw(xyz_cl,cursec,currow); |
e170e0f9 | 991 | if(fDigits->GetTrackID((Int_t)rint(xyz_cl[2]),(Int_t)rint(xyz_cl[1]),0)!=mcId && |
992 | fDigits->GetTrackID((Int_t)rint(xyz_cl[2]),(Int_t)rint(xyz_cl[1]),1)!=mcId && | |
993 | fDigits->GetTrackID((Int_t)rint(xyz_cl[2]),(Int_t)rint(xyz_cl[1]),2)!=mcId) | |
e1a32fa5 | 994 | continue; |
494fad94 | 995 | AliL3Transform::Raw2Local(xyz_ex,cursec,currow,cluster->fY,cluster->fX); |
996 | AliL3Transform::Raw2Local(xyz_cl,cursec,currow,xyz_cl[1],xyz_cl[2]); | |
294ee877 | 997 | Float_t resy = xyz_cl[1] - xyz_ex[1];//cluster->GetY() |
998 | Float_t resz = xyz_cl[2] - xyz_ex[2];//cluster->GetZ() | |
e1a32fa5 | 999 | |
294ee877 | 1000 | ntuppel->Fill(slice,padrow,resy,resz,xyz_ex[2],part->Pt()); |
78127e35 | 1001 | } |
e1a32fa5 | 1002 | } |
294ee877 | 1003 | arr->ClearRow(cursec,currow); |
78127e35 | 1004 | } |
e1a32fa5 | 1005 | |
78127e35 | 1006 | return ntuppel; |
1007 | } | |
355debe1 | 1008 | |
1009 | void AliL3Evaluate::GetCFeff(Char_t *outfile) | |
78127e35 | 1010 | { |
78127e35 | 1011 | |
355debe1 | 1012 | TNtuple *ntuppel = new TNtuple("ntuppel","Cluster finder efficiency","row:ncrossings:nclusters"); |
1013 | ||
1014 | AliTPC *TPC = (AliTPC*)gAlice->GetDetector("TPC"); | |
1015 | ||
1016 | TPC->SetParam(fParam); | |
78127e35 | 1017 | |
355debe1 | 1018 | Int_t ver = TPC->IsVersion(); |
494fad94 | 1019 | LOG(AliL3Log::kInformational,"AliL3Evaluate::GetCFeff","TPC version") |
355debe1 | 1020 | <<"TPC version "<<ver<<" found on file"<<ENDLOG; |
1021 | ||
1022 | Int_t zero=TPC->GetParam()->GetZeroSup(); | |
1023 | ||
1024 | Int_t np = gAlice->GetNtrack(); | |
1025 | ||
1026 | Int_t crossed,recs; | |
1027 | Int_t *count = new Int_t[np]; //np number of particles. | |
1028 | Int_t i; | |
1029 | Float_t xyz[3]; | |
1030 | for (i=0; i<np; i++) count[i]=0; | |
1031 | for(Int_t sl=fMinSlice; sl<=fMaxSlice; sl++) | |
78127e35 | 1032 | { |
355debe1 | 1033 | for (i=0; i<=175; i++) |
78127e35 | 1034 | { |
355debe1 | 1035 | crossed=0; |
1036 | recs=0; | |
1037 | Int_t index = fRowid[sl][i]; | |
1038 | if (!fDigitsTree->GetEvent(index)) continue; | |
1039 | Int_t sec,row; | |
1040 | fParam->AdjustSectorRow(fDigits->GetID(),sec,row); | |
1041 | fDigits->First(); | |
1042 | do { | |
1043 | Int_t it=fDigits->CurrentRow(), ip=fDigits->CurrentColumn(); | |
1044 | Short_t dig = fDigits->GetDigit(it,ip); | |
1045 | ||
1046 | if(dig<=fParam->GetZeroSup()) continue; | |
1047 | if(it < fParam->GetMaxTBin()-1 && it > 0) | |
1048 | if(fDigits->GetDigit(it+1,ip) <= fParam->GetZeroSup() | |
1049 | && fDigits->GetDigit(it-1,ip) <= fParam->GetZeroSup()) | |
1050 | continue; | |
1051 | ||
494fad94 | 1052 | AliL3Transform::Raw2Local(xyz,sec,row,ip,it); |
355debe1 | 1053 | if(fParam->GetPadRowRadii(sec,row)<230./250.*fabs(xyz[2])) |
1054 | continue; | |
1055 | ||
1056 | ||
1057 | Int_t idx0=fDigits->GetTrackID(it,ip,0); | |
1058 | Int_t idx1=fDigits->GetTrackID(it,ip,1); | |
1059 | Int_t idx2=fDigits->GetTrackID(it,ip,2); | |
1060 | ||
1061 | if (idx0>=0 && dig>=zero) count[idx0]+=1; | |
1062 | if (idx1>=0 && dig>=zero) count[idx1]+=1; | |
1063 | if (idx2>=0 && dig>=zero) count[idx2]+=1; | |
1064 | } while (fDigits->Next()); | |
1065 | ||
1066 | for (Int_t j=0; j<np; j++) | |
78127e35 | 1067 | { |
355debe1 | 1068 | if (count[j]>1) //at least two digits at this padrow |
494fad94 | 1069 | { |
1070 | crossed++; | |
1071 | count[j]=0; | |
1072 | } | |
355debe1 | 1073 | } |
1074 | AliL3SpacePointData *points = fClusters[sl][0]; | |
494fad94 | 1075 | for(UInt_t k=0; k<fNcl[sl][0]; k++) |
355debe1 | 1076 | { |
494fad94 | 1077 | if(points[k].fPadRow!=i) continue; |
355debe1 | 1078 | recs++; |
78127e35 | 1079 | } |
355debe1 | 1080 | ntuppel->Fill(i,crossed,recs); |
78127e35 | 1081 | } |
494fad94 | 1082 | |
78127e35 | 1083 | } |
355debe1 | 1084 | delete[] count; |
1085 | ||
1086 | TFile *file = TFile::Open(outfile,"RECREATE"); | |
1087 | ntuppel->Write(); | |
1088 | file->Close(); | |
1089 | ||
78127e35 | 1090 | } |
355debe1 | 1091 | |
78127e35 | 1092 | Bool_t AliL3Evaluate::GetParticleCrossingPoint(TParticle *part,Int_t slice,Int_t padrow,Float_t *xyz) |
1093 | { | |
1094 | //Calcluate the crossing point between a generated particle and given padrow. | |
1095 | ||
1096 | ||
1097 | Double_t kappa = 0.2*0.0029980/part->Pt(); | |
1098 | ||
1099 | Double_t radius = 1/fabs(kappa); | |
1100 | if(part->GetPdgCode() > 0) kappa = -kappa; | |
1101 | ||
23908b9b | 1102 | Int_t charg; |
1103 | if(kappa>0) | |
1104 | charg=-1; | |
1105 | else | |
1106 | charg=1; | |
1107 | ||
78127e35 | 1108 | Float_t angl[1] = {part->Phi()}; |
1109 | ||
494fad94 | 1110 | AliL3Transform::Global2LocalAngle(angl,slice); |
78127e35 | 1111 | |
1112 | Double_t charge = -1.*kappa; | |
1113 | Double_t trackPhi0 = angl[0] + charge*0.5*Pi/fabs(charge); | |
1114 | ||
1115 | Double_t x0=0; | |
1116 | Double_t y0=0; | |
1117 | Double_t xc = x0 - radius * cos(trackPhi0); | |
1118 | Double_t yc = y0 - radius * sin(trackPhi0); | |
1119 | ||
1120 | //printf("radius %f xc %f yc %f\n",radius,xc,yc); | |
1121 | ||
494fad94 | 1122 | Double_t xHit = AliL3Transform::Row2X(padrow); |
78127e35 | 1123 | xyz[0] = xHit; |
1124 | Double_t aa = (xHit - xc)*(xHit - xc); | |
1125 | Double_t r2 = radius*radius; | |
1126 | if(aa > r2) | |
1127 | return false; | |
1128 | ||
1129 | Double_t aa2 = sqrt(r2 - aa); | |
1130 | Double_t y1 = yc + aa2; | |
1131 | Double_t y2 = yc - aa2; | |
1132 | xyz[1] = y1; | |
1133 | if(fabs(y2) < fabs(y1)) xyz[1] = y2; | |
1134 | ||
23908b9b | 1135 | Double_t tgl = part->Pz()/part->Pt(); |
1136 | ||
1137 | Double_t yHit = xyz[1]; | |
1138 | Double_t angle1 = atan2((yHit - yc),(xHit - xc)); | |
1139 | if(angle1 < 0) angle1 += 2.*Pi; | |
1140 | Double_t angle2 = atan2((0 - yc),(0 - xc)); | |
1141 | if(angle2 < 0) angle2 += 2.*Pi; | |
1142 | Double_t diff_angle = angle1 - angle2; | |
1143 | diff_angle = fmod(diff_angle,2*Pi); | |
1144 | if((charg*diff_angle) > 0) diff_angle = diff_angle - charg*2.*Pi; | |
1145 | Double_t s_tot = fabs(diff_angle)*radius; | |
1146 | Double_t zHit = 0 + s_tot*tgl; | |
1147 | xyz[2] = zHit; | |
1148 | ||
78127e35 | 1149 | return true; |
1150 | } | |
1151 |