]>
Commit | Line | Data |
---|---|---|
7f4044f0 | 1 | //------------------------------------------------------------------------- |
2 | // Implementation of the ITS clusterer V2 class | |
3 | // | |
4 | // Origin: Iouri Belikov, CERN, Jouri.Belikov@cern.ch | |
42283fd4 | 5 | // This class is no longer used for ITS recosntruction: |
6 | // it has been replaced by the AliITSClusterFinderV2SXD classes | |
7 | // It is still used as mother class by HLT reconstruction | |
7f4044f0 | 8 | //------------------------------------------------------------------------- |
60b9526b | 9 | |
7f4044f0 | 10 | |
c93255fe | 11 | #include "AliLoader.h" |
7f4044f0 | 12 | #include "AliRun.h" |
13 | ||
14 | #include "AliITSclustererV2.h" | |
15 | #include "AliITSclusterV2.h" | |
7d62fb64 | 16 | #include "AliITSDetTypeRec.h" |
7941072e | 17 | #include "AliRawReader.h" |
c391f9d9 | 18 | #include "AliITSRawStreamSPD.h" |
19 | #include "AliITSRawStreamSDD.h" | |
20 | #include "AliITSRawStreamSSD.h" | |
7f4044f0 | 21 | |
7f4044f0 | 22 | #include <TFile.h> |
23 | #include <TTree.h> | |
24 | #include <TClonesArray.h> | |
79c75366 | 25 | #include "AliITSgeomTGeo.h" |
e869281d | 26 | #include "AliITSdigitSPD.h" |
27 | #include "AliITSdigitSDD.h" | |
28 | #include "AliITSdigitSSD.h" | |
5d12ce38 | 29 | #include "AliMC.h" |
7f4044f0 | 30 | |
31 | ClassImp(AliITSclustererV2) | |
32 | ||
33 | extern AliRun *gAlice; | |
34 | ||
e56160b8 | 35 | AliITSclustererV2::AliITSclustererV2(): |
36 | fNModules(0), | |
37 | fEvent(0), | |
38 | fI(0), | |
39 | fLastSPD1(0), | |
40 | fNySPD(0), | |
41 | fNzSPD(0), | |
42 | fYpitchSPD(0), | |
43 | fZ1pitchSPD(0), | |
44 | fZ2pitchSPD(0), | |
45 | fHwSPD(0), | |
46 | fHlSPD(0), | |
47 | fNySDD(0), | |
48 | fNzSDD(0), | |
49 | fYpitchSDD(0), | |
50 | fZpitchSDD(0), | |
51 | fHwSDD(0), | |
52 | fHlSDD(0), | |
53 | fYoffSDD(0), | |
54 | fLastSSD1(0), | |
55 | fYpitchSSD(0), | |
56 | fHwSSD(0), | |
57 | fHlSSD(0), | |
58 | fTanP(0), | |
59 | fTanN(0){ | |
60 | //default constructor | |
c98634db | 61 | for(Int_t i=0;i<260;i++)fYSPD[i]=0.; |
62 | for(Int_t i=0;i<170;i++)fZSPD[i]=0.; | |
90616ce2 | 63 | for(Int_t i=0;i<2200;i++){ |
64 | fYshift[i]=0.; | |
65 | fZshift[i]=0.; | |
66 | fNdet[i]=0; | |
67 | fNlayer[i]=0; | |
68 | } | |
69 | ||
70 | } | |
79c75366 | 71 | AliITSclustererV2::AliITSclustererV2(const Char_t *geom): |
72 | fNModules(AliITSgeomTGeo::GetNModules()), | |
e56160b8 | 73 | fEvent(0), |
74 | fI(0), | |
79c75366 | 75 | fLastSPD1(AliITSgeomTGeo::GetModuleIndex(2,1,1)-1), |
e56160b8 | 76 | fNySPD(256), |
77 | fNzSPD(160), | |
78 | fYpitchSPD(0.0050), | |
79 | fZ1pitchSPD(0.0425), | |
80 | fZ2pitchSPD(0.0625), | |
81 | fHwSPD(0.64), | |
82 | fHlSPD(3.48), | |
83 | fNySDD(256), | |
84 | fNzSDD(256), | |
85 | fYpitchSDD(0.01825), | |
86 | fZpitchSDD(0.02940), | |
87 | fHwSDD(3.5085), | |
88 | fHlSDD(3.7632), | |
89 | fYoffSDD(0.0425), | |
79c75366 | 90 | fLastSSD1(AliITSgeomTGeo::GetModuleIndex(6,1,1)-1), |
e56160b8 | 91 | fYpitchSSD(0.0095), |
92 | fHwSSD(3.65), | |
93 | fHlSSD(2.00), | |
94 | fTanP(0.0275), | |
95 | fTanN(0.0075) { | |
7f4044f0 | 96 | //------------------------------------------------------------ |
97 | // Standard constructor | |
98 | //------------------------------------------------------------ | |
79c75366 | 99 | if (geom) { |
100 | AliWarning("\"geom\" is actually a dummy argument !"); | |
c630aafd | 101 | } |
7f4044f0 | 102 | Int_t m; |
79c75366 | 103 | for (m=0; m<fNModules; m++) { |
104 | Int_t lay,lad,det; AliITSgeomTGeo::GetModuleId(m,lay,lad,det); | |
105 | const TGeoHMatrix *tm=AliITSgeomTGeo::GetTracking2LocalMatrix(m); | |
106 | fYshift[m] = (tm->Inverse()).GetTranslation()[1]; | |
107 | fZshift[m] = (tm->Inverse()).GetTranslation()[2]; | |
108 | fNdet[m] = (lad-1)*AliITSgeomTGeo::GetNDetectors(lay) + (det-1); | |
e43c066c | 109 | fNlayer[m] = lay-1; |
7f4044f0 | 110 | } |
111 | ||
112 | //SPD geometry | |
7f4044f0 | 113 | fYSPD[0]=0.5*fYpitchSPD; |
114 | for (m=1; m<fNySPD; m++) fYSPD[m]=fYSPD[m-1]+fYpitchSPD; | |
115 | fZSPD[0]=fZ1pitchSPD; | |
116 | for (m=1; m<fNzSPD; m++) { | |
117 | Double_t dz=fZ1pitchSPD; | |
118 | if (m==31 || m==32 || m==63 || m==64 || m==95 || m==96 || | |
119 | m==127 || m==128) dz=fZ2pitchSPD; | |
120 | fZSPD[m]=fZSPD[m-1]+dz; | |
121 | } | |
122 | for (m=0; m<fNzSPD; m++) { | |
123 | Double_t dz=0.5*fZ1pitchSPD; | |
124 | if (m==31 || m==32 || m==63 || m==64 || m==95 || m==96 || | |
125 | m==127 || m==128) dz=0.5*fZ2pitchSPD; | |
126 | fZSPD[m]-=dz; | |
127 | } | |
128 | ||
7f4044f0 | 129 | } |
130 | ||
e3d91d99 | 131 | |
c630aafd | 132 | Int_t AliITSclustererV2::Digits2Clusters(TTree *dTree, TTree *cTree) { |
7f4044f0 | 133 | //------------------------------------------------------------ |
134 | // This function creates ITS clusters | |
135 | //------------------------------------------------------------ | |
136 | Int_t ncl=0; | |
7f4044f0 | 137 | |
7f4044f0 | 138 | if (!dTree) { |
c630aafd | 139 | Error("Digits2Clusters","Can't get the tree with digits !"); |
140 | return 1; | |
7f4044f0 | 141 | } |
142 | ||
143 | TClonesArray *digitsSPD=new TClonesArray("AliITSdigitSPD",3000); | |
144 | dTree->SetBranchAddress("ITSDigitsSPD",&digitsSPD); | |
145 | TClonesArray *digitsSDD=new TClonesArray("AliITSdigitSDD",3000); | |
146 | dTree->SetBranchAddress("ITSDigitsSDD",&digitsSDD); | |
147 | TClonesArray *digitsSSD=new TClonesArray("AliITSdigitSSD",3000); | |
148 | dTree->SetBranchAddress("ITSDigitsSSD",&digitsSSD); | |
149 | ||
7f4044f0 | 150 | TClonesArray *clusters=new TClonesArray("AliITSclusterV2",1000); |
c630aafd | 151 | TBranch *branch=cTree->GetBranch("Clusters"); |
152 | if (!branch) cTree->Branch("Clusters",&clusters); | |
153 | else branch->SetAddress(&clusters); | |
154 | ||
155 | Int_t mmax=(Int_t)dTree->GetEntries(); | |
cbca22ab | 156 | if (mmax!=fNModules) { |
157 | Error("Digits2Clusters","Number of entries != number of modules !"); | |
158 | return 1; | |
159 | } | |
7f4044f0 | 160 | |
161 | for (fI=0; fI<mmax; fI++) { | |
162 | dTree->GetEvent(fI); | |
163 | ||
164 | if (digitsSPD->GetEntriesFast()!=0) | |
babd135a | 165 | FindClustersSPD(digitsSPD,clusters); |
166 | else | |
167 | if(digitsSDD->GetEntriesFast()!=0) | |
168 | FindClustersSDD(digitsSDD,clusters); | |
169 | else if(digitsSSD->GetEntriesFast()!=0) | |
170 | FindClustersSSD(digitsSSD,clusters); | |
171 | ||
7f4044f0 | 172 | ncl+=clusters->GetEntriesFast(); |
173 | ||
c630aafd | 174 | cTree->Fill(); |
7f4044f0 | 175 | |
176 | digitsSPD->Clear(); | |
177 | digitsSDD->Clear(); | |
178 | digitsSSD->Clear(); | |
179 | clusters->Clear(); | |
180 | } | |
c630aafd | 181 | |
182 | //cTree->Write(); | |
7f4044f0 | 183 | |
184 | delete clusters; | |
185 | ||
186 | delete digitsSPD; | |
187 | delete digitsSDD; | |
188 | delete digitsSSD; | |
189 | ||
7941072e | 190 | //delete dTree; |
191 | ||
c630aafd | 192 | Info("Digits2Clusters","Number of found clusters : %d",ncl); |
7f4044f0 | 193 | |
c630aafd | 194 | return 0; |
7f4044f0 | 195 | } |
196 | ||
7941072e | 197 | void AliITSclustererV2::Digits2Clusters(AliRawReader* rawReader) { |
c391f9d9 | 198 | //------------------------------------------------------------ |
199 | // This function creates ITS clusters from raw data | |
200 | //------------------------------------------------------------ | |
33c3c91a | 201 | AliRunLoader* runLoader = AliRunLoader::Instance(); |
7941072e | 202 | if (!runLoader) { |
203 | Error("Digits2Clusters", "no run loader found"); | |
204 | return; | |
205 | } | |
babd135a | 206 | runLoader->LoadKinematics(); |
7941072e | 207 | AliLoader* itsLoader = runLoader->GetLoader("ITSLoader"); |
208 | if (!itsLoader) { | |
209 | Error("Digits2Clusters", "no loader for ITS found"); | |
c391f9d9 | 210 | return; |
211 | } | |
7941072e | 212 | if (!itsLoader->TreeR()) itsLoader->MakeTree("R"); |
213 | TTree* cTree = itsLoader->TreeR(); | |
c391f9d9 | 214 | |
c391f9d9 | 215 | TClonesArray *array=new TClonesArray("AliITSclusterV2",1000); |
7941072e | 216 | cTree->Branch("Clusters",&array); |
c391f9d9 | 217 | delete array; |
218 | ||
f1e0c1c5 | 219 | TClonesArray** clusters = new TClonesArray*[fNModules]; |
04fa961a | 220 | for (Int_t iModule = 0; iModule < fNModules; iModule++) { |
221 | clusters[iModule] = NULL; | |
222 | } | |
c391f9d9 | 223 | // one TClonesArray per module |
224 | ||
7941072e | 225 | rawReader->Reset(); |
226 | AliITSRawStreamSPD inputSPD(rawReader); | |
c391f9d9 | 227 | FindClustersSPD(&inputSPD, clusters); |
7941072e | 228 | |
229 | rawReader->Reset(); | |
230 | AliITSRawStreamSDD inputSDD(rawReader); | |
c391f9d9 | 231 | FindClustersSDD(&inputSDD, clusters); |
7941072e | 232 | |
233 | rawReader->Reset(); | |
234 | AliITSRawStreamSSD inputSSD(rawReader); | |
c391f9d9 | 235 | FindClustersSSD(&inputSSD, clusters); |
236 | ||
237 | // write all clusters to the tree | |
238 | Int_t nClusters = 0; | |
c157c94e | 239 | TClonesArray *emptyArray=new TClonesArray("AliITSclusterV2"); |
c391f9d9 | 240 | for (Int_t iModule = 0; iModule < fNModules; iModule++) { |
04fa961a | 241 | array = clusters[iModule]; |
c391f9d9 | 242 | if (!array) { |
243 | Error("Digits2Clusters", "data for module %d missing!", iModule); | |
c157c94e | 244 | array = emptyArray; |
c391f9d9 | 245 | } |
7941072e | 246 | cTree->SetBranchAddress("Clusters", &array); |
247 | cTree->Fill(); | |
c391f9d9 | 248 | nClusters += array->GetEntriesFast(); |
c391f9d9 | 249 | } |
c157c94e | 250 | delete emptyArray; |
251 | ||
7941072e | 252 | itsLoader->WriteRecPoints("OVERWRITE"); |
c391f9d9 | 253 | |
04fa961a | 254 | delete[] clusters; |
255 | ||
c391f9d9 | 256 | Info("Digits2Clusters", "total number of found clusters in ITS: %d\n", |
257 | nClusters); | |
258 | } | |
259 | ||
7f4044f0 | 260 | //**** Fast clusters ******************************* |
261 | #include "TParticle.h" | |
262 | ||
7d62fb64 | 263 | //#include "AliITS.h" |
7f4044f0 | 264 | #include "AliITSmodule.h" |
265 | #include "AliITSRecPoint.h" | |
266 | #include "AliITSsimulationFastPoints.h" | |
267 | #include "AliITSRecPoint.h" | |
268 | ||
7d62fb64 | 269 | |
7f4044f0 | 270 | static void CheckLabels(Int_t lab[3]) { |
271 | //------------------------------------------------------------ | |
272 | // Tries to find mother's labels | |
273 | //------------------------------------------------------------ | |
33c3c91a | 274 | AliRunLoader *rl = AliRunLoader::Instance(); |
60b9526b | 275 | TTree *trK=(TTree*)rl->TreeK(); |
276 | ||
277 | if(trK){ | |
7f4044f0 | 278 | Int_t label=lab[0]; |
279 | if (label>=0) { | |
60b9526b | 280 | TParticle *part=(TParticle*)gAlice->GetMCApp()->Particle(label); |
281 | label=-3; | |
282 | while (part->P() < 0.005) { | |
283 | Int_t m=part->GetFirstMother(); | |
284 | if (m<0) { | |
285 | Info("CheckLabels","Primary momentum: %f",part->P()); | |
286 | break; | |
287 | } | |
288 | if (part->GetStatusCode()>0) { | |
289 | Info("CheckLabels","Primary momentum: %f",part->P()); | |
290 | break; | |
291 | } | |
292 | label=m; | |
293 | part=(TParticle*)gAlice->GetMCApp()->Particle(label); | |
294 | } | |
5af4a2d0 | 295 | if(lab[1]<0){ |
296 | lab[1]=label; | |
297 | } | |
298 | else if (lab[2]<0) { | |
299 | lab[2]=label; | |
300 | } | |
301 | else { | |
302 | // cerr<<"CheckLabels : No empty labels !\n"; | |
303 | } | |
7f4044f0 | 304 | } |
60b9526b | 305 | } |
7f4044f0 | 306 | } |
7d62fb64 | 307 | |
308 | /* | |
babd135a | 309 | static void CheckLabels(Int_t lab[3]) { |
310 | //------------------------------------------------------------ | |
311 | // Tries to find mother's labels | |
312 | //------------------------------------------------------------ | |
313 | ||
0e986ef9 | 314 | if(lab[0]<0 && lab[1]<0 && lab[2]<0) return; // In case of no labels just exit |
315 | ||
babd135a | 316 | Int_t ntracks = gAlice->GetMCApp()->GetNtrack(); |
317 | for (Int_t i=0;i<3;i++){ | |
318 | Int_t label = lab[i]; | |
319 | if (label>=0 && label<ntracks) { | |
320 | TParticle *part=(TParticle*)gAlice->GetMCApp()->Particle(label); | |
321 | if (part->P() < 0.005) { | |
322 | Int_t m=part->GetFirstMother(); | |
323 | if (m<0) { | |
324 | continue; | |
325 | } | |
326 | if (part->GetStatusCode()>0) { | |
327 | continue; | |
328 | } | |
329 | lab[i]=m; | |
330 | } | |
331 | } | |
332 | } | |
333 | ||
334 | } | |
7d62fb64 | 335 | */ |
babd135a | 336 | static void CheckLabels2(Int_t lab[10]) { |
337 | //------------------------------------------------------------ | |
338 | // Tries to find mother's labels | |
339 | //------------------------------------------------------------ | |
33c3c91a | 340 | AliRunLoader *rl = AliRunLoader::Instance(); |
60b9526b | 341 | TTree *trK=(TTree*)rl->TreeK(); |
0e986ef9 | 342 | |
60b9526b | 343 | if(trK){ |
344 | Int_t nlabels =0; | |
345 | for (Int_t i=0;i<10;i++) if (lab[i]>=0) nlabels++; | |
346 | if(nlabels == 0) return; // In case of no labels just exit | |
e43c066c | 347 | |
60b9526b | 348 | Int_t ntracks = gAlice->GetMCApp()->GetNtrack(); |
349 | ||
350 | for (Int_t i=0;i<10;i++){ | |
351 | Int_t label = lab[i]; | |
352 | if (label>=0 && label<ntracks) { | |
353 | TParticle *part=(TParticle*)gAlice->GetMCApp()->Particle(label); | |
354 | if (part->P() < 0.02) { | |
e43c066c | 355 | Int_t m=part->GetFirstMother(); |
356 | if (m<0) { | |
357 | continue; | |
358 | } | |
359 | if (part->GetStatusCode()>0) { | |
360 | continue; | |
361 | } | |
362 | lab[i]=m; | |
60b9526b | 363 | } |
364 | else | |
365 | if (part->P() < 0.12 && nlabels>3) { | |
366 | lab[i]=-2; | |
367 | nlabels--; | |
368 | } | |
e43c066c | 369 | } |
60b9526b | 370 | else{ |
371 | if ( (label>ntracks||label <0) && nlabels>3) { | |
e43c066c | 372 | lab[i]=-2; |
373 | nlabels--; | |
374 | } | |
60b9526b | 375 | } |
376 | } | |
377 | if (nlabels>3){ | |
378 | for (Int_t i=0;i<10;i++){ | |
379 | if (nlabels>3){ | |
380 | Int_t label = lab[i]; | |
381 | if (label>=0 && label<ntracks) { | |
382 | TParticle *part=(TParticle*)gAlice->GetMCApp()->Particle(label); | |
383 | if (part->P() < 0.1) { | |
384 | lab[i]=-2; | |
385 | nlabels--; | |
386 | } | |
e43c066c | 387 | } |
babd135a | 388 | } |
babd135a | 389 | } |
e43c066c | 390 | } |
e43c066c | 391 | |
60b9526b | 392 | //compress labels -- if multi-times the same |
393 | Int_t lab2[10]; | |
394 | for (Int_t i=0;i<10;i++) lab2[i]=-2; | |
395 | for (Int_t i=0;i<10 ;i++){ | |
396 | if (lab[i]<0) continue; | |
397 | for (Int_t j=0;j<10 &&lab2[j]!=lab[i];j++){ | |
398 | if (lab2[j]<0) { | |
399 | lab2[j]= lab[i]; | |
400 | break; | |
401 | } | |
babd135a | 402 | } |
403 | } | |
60b9526b | 404 | for (Int_t j=0;j<10;j++) lab[j]=lab2[j]; |
babd135a | 405 | } |
babd135a | 406 | } |
407 | ||
408 | static void AddLabel(Int_t lab[10], Int_t label) { | |
60b9526b | 409 | // add label of the particle in the kine tree which originates this cluster |
410 | // (used for reconstruction of MC data only, for comparison purposes) | |
33c3c91a | 411 | AliRunLoader *rl = AliRunLoader::Instance(); |
60b9526b | 412 | TTree *trK=(TTree*)rl->TreeK(); |
0e986ef9 | 413 | |
60b9526b | 414 | if(trK){ |
415 | if(label<0) return; // In case of no label just exit | |
0e986ef9 | 416 | |
60b9526b | 417 | Int_t ntracks = gAlice->GetMCApp()->GetNtrack(); |
418 | if (label>ntracks) return; | |
419 | for (Int_t i=0;i<10;i++){ | |
420 | // if (label<0) break; | |
421 | if (lab[i]==label) break; | |
422 | if (lab[i]<0) { | |
423 | lab[i]= label; | |
424 | break; | |
425 | } | |
babd135a | 426 | } |
427 | } | |
428 | } | |
7f4044f0 | 429 | |
1cca57bf | 430 | void AliITSclustererV2::RecPoints2Clusters |
431 | (const TClonesArray *points, Int_t idx, TClonesArray *clusters) { | |
7f4044f0 | 432 | //------------------------------------------------------------ |
1cca57bf | 433 | // Conversion AliITSRecPoint -> AliITSclusterV2 for the ITS |
434 | // subdetector indexed by idx | |
7f4044f0 | 435 | //------------------------------------------------------------ |
436 | TClonesArray &cl=*clusters; | |
437 | Int_t ncl=points->GetEntriesFast(); | |
438 | for (Int_t i=0; i<ncl; i++) { | |
439 | AliITSRecPoint *p = (AliITSRecPoint *)points->UncheckedAt(i); | |
440 | Float_t lp[5]; | |
00a7cc50 | 441 | lp[0]=-(-p->GetDetLocalX()+fYshift[idx]); if (idx<=fLastSPD1) lp[0]*=-1; //SPD1 |
f363d377 | 442 | lp[1]= -p->GetZ()+fZshift[idx]; |
00a7cc50 | 443 | lp[2]=p->GetSigmaDetLocX2(); |
1cca57bf | 444 | lp[3]=p->GetSigmaZ2(); |
b6087704 | 445 | lp[4]=p->GetQ()*36./23333.; //electrons -> ADC |
7f4044f0 | 446 | Int_t lab[4]; |
447 | lab[0]=p->GetLabel(0); lab[1]=p->GetLabel(1); lab[2]=p->GetLabel(2); | |
1cca57bf | 448 | lab[3]=fNdet[idx]; |
7f4044f0 | 449 | CheckLabels(lab); |
babd135a | 450 | Int_t dummy[3]={0,0,0}; |
451 | new (cl[i]) AliITSclusterV2(lab,lp, dummy); | |
7f4044f0 | 452 | } |
453 | } | |
454 | ||
7f4044f0 | 455 | //*********************************** |
456 | ||
7f4044f0 | 457 | |
458 | void AliITSclustererV2:: | |
459 | FindCluster(Int_t k,Int_t maxz,AliBin *bins,Int_t &n,Int_t *idx) { | |
460 | //------------------------------------------------------------ | |
461 | // returns an array of indices of digits belonging to the cluster | |
462 | // (needed when the segmentation is not regular) | |
463 | //------------------------------------------------------------ | |
464 | if (n<200) idx[n++]=bins[k].GetIndex(); | |
465 | bins[k].Use(); | |
466 | ||
467 | if (bins[k-maxz].IsNotUsed()) FindCluster(k-maxz,maxz,bins,n,idx); | |
468 | if (bins[k-1 ].IsNotUsed()) FindCluster(k-1 ,maxz,bins,n,idx); | |
469 | if (bins[k+maxz].IsNotUsed()) FindCluster(k+maxz,maxz,bins,n,idx); | |
470 | if (bins[k+1 ].IsNotUsed()) FindCluster(k+1 ,maxz,bins,n,idx); | |
471 | /* | |
472 | if (bins[k-maxz-1].IsNotUsed()) FindCluster(k-maxz-1,maxz,bins,n,idx); | |
473 | if (bins[k-maxz+1].IsNotUsed()) FindCluster(k-maxz+1,maxz,bins,n,idx); | |
474 | if (bins[k+maxz-1].IsNotUsed()) FindCluster(k+maxz-1,maxz,bins,n,idx); | |
475 | if (bins[k+maxz+1].IsNotUsed()) FindCluster(k+maxz+1,maxz,bins,n,idx); | |
476 | */ | |
477 | } | |
478 | ||
479 | void AliITSclustererV2:: | |
480 | FindClustersSPD(const TClonesArray *digits, TClonesArray *clusters) { | |
481 | //------------------------------------------------------------ | |
482 | // Actual SPD cluster finder | |
483 | //------------------------------------------------------------ | |
c391f9d9 | 484 | Int_t kNzBins = fNzSPD + 2; |
485 | const Int_t kMAXBIN=kNzBins*(fNySPD+2); | |
7f4044f0 | 486 | |
487 | Int_t ndigits=digits->GetEntriesFast(); | |
488 | AliBin *bins=new AliBin[kMAXBIN]; | |
489 | ||
490 | Int_t k; | |
491 | AliITSdigitSPD *d=0; | |
492 | for (k=0; k<ndigits; k++) { | |
493 | d=(AliITSdigitSPD*)digits->UncheckedAt(k); | |
494 | Int_t i=d->GetCoord2()+1; //y | |
495 | Int_t j=d->GetCoord1()+1; | |
c391f9d9 | 496 | bins[i*kNzBins+j].SetIndex(k); |
497 | bins[i*kNzBins+j].SetMask(1); | |
7f4044f0 | 498 | } |
499 | ||
500 | Int_t n=0; TClonesArray &cl=*clusters; | |
501 | for (k=0; k<kMAXBIN; k++) { | |
502 | if (!bins[k].IsNotUsed()) continue; | |
503 | Int_t ni=0, idx[200]; | |
c391f9d9 | 504 | FindCluster(k,kNzBins,bins,ni,idx); |
c630aafd | 505 | if (ni==200) { |
506 | Info("FindClustersSPD","Too big cluster !"); | |
507 | continue; | |
508 | } | |
babd135a | 509 | Int_t milab[10]; |
510 | for (Int_t ilab=0;ilab<10;ilab++){ | |
511 | milab[ilab]=-2; | |
512 | } | |
513 | ||
7f4044f0 | 514 | d=(AliITSdigitSPD*)digits->UncheckedAt(idx[0]); |
515 | Int_t ymin=d->GetCoord2(),ymax=ymin; | |
516 | Int_t zmin=d->GetCoord1(),zmax=zmin; | |
e43c066c | 517 | |
7f4044f0 | 518 | for (Int_t l=0; l<ni; l++) { |
519 | d=(AliITSdigitSPD*)digits->UncheckedAt(idx[l]); | |
520 | ||
521 | if (ymin > d->GetCoord2()) ymin=d->GetCoord2(); | |
522 | if (ymax < d->GetCoord2()) ymax=d->GetCoord2(); | |
523 | if (zmin > d->GetCoord1()) zmin=d->GetCoord1(); | |
524 | if (zmax < d->GetCoord1()) zmax=d->GetCoord1(); | |
e43c066c | 525 | // MI addition - find all labels in cluster |
526 | for (Int_t dlab=0;dlab<10;dlab++){ | |
babd135a | 527 | Int_t digitlab = (d->GetTracks())[dlab]; |
528 | if (digitlab<0) continue; | |
e43c066c | 529 | AddLabel(milab,digitlab); |
babd135a | 530 | } |
e43c066c | 531 | if (milab[9]>0) CheckLabels2(milab); |
532 | } | |
babd135a | 533 | CheckLabels2(milab); |
e43c066c | 534 | // |
535 | //Int_t idy = (fNlayer[fI]==0)? 2:3; | |
536 | //for (Int_t iz=zmin; iz<=zmax;iz+=2) | |
537 | //Int_t idy = (ymax-ymin)/4.; // max 2 clusters | |
538 | Int_t idy = 0; // max 2 clusters | |
539 | if (fNlayer[fI]==0 &&idy<3) idy=3; | |
540 | if (fNlayer[fI]==1 &&idy<4) idy=4; | |
541 | Int_t idz =3; | |
542 | for (Int_t iz=zmin; iz<=zmax;iz+=idz) | |
543 | for (Int_t iy=ymin; iy<=ymax;iy+=idy){ | |
544 | // | |
e8f4b841 | 545 | Int_t nodigits =0; |
0e986ef9 | 546 | Float_t y=0.,z=0.,q=0.; |
e43c066c | 547 | for (Int_t l=0; l<ni; l++) { |
548 | d=(AliITSdigitSPD*)digits->UncheckedAt(idx[l]); | |
549 | if (zmax-zmin>=idz || ymax-ymin>=idy){ | |
550 | if (TMath::Abs( d->GetCoord2()-iy)>0.75*idy) continue; | |
551 | if (TMath::Abs( d->GetCoord1()-iz)>0.75*idz) continue; | |
552 | } | |
e8f4b841 | 553 | nodigits++; |
0e986ef9 | 554 | Float_t qq=d->GetSignal(); |
e43c066c | 555 | y+=qq*fYSPD[d->GetCoord2()]; z+=qq*fZSPD[d->GetCoord1()]; q+=qq; |
556 | ||
557 | } | |
e8f4b841 | 558 | if (nodigits==0) continue; |
e43c066c | 559 | y/=q; z/=q; |
560 | y-=fHwSPD; z-=fHlSPD; | |
561 | ||
562 | Float_t lp[5]; | |
563 | lp[0]=-(-y+fYshift[fI]); if (fI<=fLastSPD1) lp[0]=-lp[0]; | |
564 | lp[1]= -z+fZshift[fI]; | |
565 | // Float_t factor=TMath::Max(double(ni-3.),1.5); | |
566 | Float_t factory=TMath::Max(ymax-ymin,1); | |
567 | Float_t factorz=TMath::Max(zmax-zmin,1); | |
568 | factory*= factory; | |
569 | factorz*= factorz; | |
570 | //lp[2]= (fYpitchSPD*fYpitchSPD/12.)*factory; | |
571 | //lp[3]= (fZ1pitchSPD*fZ1pitchSPD/12.)*factorz; | |
572 | lp[2]= (fYpitchSPD*fYpitchSPD/12.); | |
573 | lp[3]= (fZ1pitchSPD*fZ1pitchSPD/12.); | |
574 | //lp[4]= q; | |
575 | lp[4]= (zmax-zmin+1)*100 + (ymax-ymin+1); | |
576 | ||
577 | milab[3]=fNdet[fI]; | |
e43c066c | 578 | Int_t info[3] = {ymax-ymin+1,zmax-zmin+1,fNlayer[fI]}; |
579 | new (cl[n]) AliITSclusterV2(milab,lp,info); n++; | |
580 | } | |
7f4044f0 | 581 | } |
e43c066c | 582 | |
38bcdcc1 | 583 | delete [] bins; |
7f4044f0 | 584 | } |
585 | ||
c391f9d9 | 586 | void AliITSclustererV2::FindClustersSPD(AliITSRawStream* input, |
587 | TClonesArray** clusters) | |
588 | { | |
589 | //------------------------------------------------------------ | |
590 | // Actual SPD cluster finder for raw data | |
591 | //------------------------------------------------------------ | |
592 | ||
593 | Int_t nClustersSPD = 0; | |
594 | Int_t kNzBins = fNzSPD + 2; | |
595 | Int_t kNyBins = fNySPD + 2; | |
596 | Int_t kMaxBin = kNzBins * kNyBins; | |
5102d526 | 597 | AliBin *binsSPD = new AliBin[kMaxBin]; |
598 | AliBin *binsSPDInit = new AliBin[kMaxBin]; | |
599 | AliBin *bins = NULL; | |
c391f9d9 | 600 | |
601 | // read raw data input stream | |
602 | while (kTRUE) { | |
603 | Bool_t next = input->Next(); | |
604 | if (!next || input->IsNewModule()) { | |
605 | Int_t iModule = input->GetPrevModuleID(); | |
606 | ||
607 | // when all data from a module was read, search for clusters | |
608 | if (bins) { | |
609 | clusters[iModule] = new TClonesArray("AliITSclusterV2"); | |
610 | Int_t nClusters = 0; | |
611 | ||
612 | for (Int_t iBin = 0; iBin < kMaxBin; iBin++) { | |
613 | if (bins[iBin].IsUsed()) continue; | |
614 | Int_t nBins = 0; | |
615 | Int_t idxBins[200]; | |
616 | FindCluster(iBin, kNzBins, bins, nBins, idxBins); | |
617 | if (nBins == 200) { | |
618 | Error("FindClustersSPD", "SPD: Too big cluster !\n"); | |
619 | continue; | |
620 | } | |
621 | ||
622 | Int_t label[4]; | |
623 | label[0] = -2; | |
624 | label[1] = -2; | |
625 | label[2] = -2; | |
626 | // label[3] = iModule; | |
627 | label[3] = fNdet[iModule]; | |
628 | ||
629 | Int_t ymin = (idxBins[0] / kNzBins) - 1; | |
630 | Int_t ymax = ymin; | |
631 | Int_t zmin = (idxBins[0] % kNzBins) - 1; | |
632 | Int_t zmax = zmin; | |
c391f9d9 | 633 | for (Int_t idx = 0; idx < nBins; idx++) { |
634 | Int_t iy = (idxBins[idx] / kNzBins) - 1; | |
635 | Int_t iz = (idxBins[idx] % kNzBins) - 1; | |
636 | if (ymin > iy) ymin = iy; | |
637 | if (ymax < iy) ymax = iy; | |
638 | if (zmin > iz) zmin = iz; | |
639 | if (zmax < iz) zmax = iz; | |
c391f9d9 | 640 | } |
0e986ef9 | 641 | |
642 | Int_t idy = 0; // max 2 clusters | |
643 | if ((iModule <= fLastSPD1) &&idy<3) idy=3; | |
644 | if ((iModule > fLastSPD1) &&idy<4) idy=4; | |
645 | Int_t idz =3; | |
646 | for (Int_t iiz=zmin; iiz<=zmax;iiz+=idz) | |
647 | for (Int_t iiy=ymin; iiy<=ymax;iiy+=idy){ | |
648 | // | |
649 | Int_t ndigits =0; | |
650 | Float_t y=0.,z=0.,q=0.; | |
651 | for (Int_t idx = 0; idx < nBins; idx++) { | |
652 | Int_t iy = (idxBins[idx] / kNzBins) - 1; | |
653 | Int_t iz = (idxBins[idx] % kNzBins) - 1; | |
654 | if (zmax-zmin>=idz || ymax-ymin>=idy){ | |
655 | if (TMath::Abs(iy-iiy)>0.75*idy) continue; | |
656 | if (TMath::Abs(iz-iiz)>0.75*idz) continue; | |
657 | } | |
658 | ndigits++; | |
659 | Float_t qBin = bins[idxBins[idx]].GetQ(); | |
660 | y += qBin * fYSPD[iy]; | |
661 | z += qBin * fZSPD[iz]; | |
662 | q += qBin; | |
663 | } | |
664 | if (ndigits==0) continue; | |
665 | y /= q; | |
666 | z /= q; | |
667 | y -= fHwSPD; | |
668 | z -= fHlSPD; | |
669 | ||
670 | Float_t hit[5]; // y, z, sigma(y)^2, sigma(z)^2, charge | |
671 | hit[0] = -(-y+fYshift[iModule]); | |
672 | if (iModule <= fLastSPD1) hit[0] = -hit[0]; | |
673 | hit[1] = -z+fZshift[iModule]; | |
674 | hit[2] = fYpitchSPD*fYpitchSPD/12.; | |
675 | hit[3] = fZ1pitchSPD*fZ1pitchSPD/12.; | |
676 | // hit[4] = q; | |
677 | hit[4] = (zmax-zmin+1)*100 + (ymax-ymin+1); | |
678 | // CheckLabels(label); | |
679 | Int_t info[3]={ymax-ymin+1,zmax-zmin+1,fNlayer[iModule]}; | |
680 | new (clusters[iModule]->AddrAt(nClusters)) | |
681 | AliITSclusterV2(label, hit,info); | |
682 | nClusters++; | |
683 | } | |
c391f9d9 | 684 | } |
685 | ||
686 | nClustersSPD += nClusters; | |
5102d526 | 687 | bins = NULL; |
c391f9d9 | 688 | } |
689 | ||
690 | if (!next) break; | |
5102d526 | 691 | bins = binsSPD; |
692 | memcpy(binsSPD,binsSPDInit,sizeof(AliBin)*kMaxBin); | |
c391f9d9 | 693 | } |
694 | ||
695 | // fill the current digit into the bins array | |
90616ce2 | 696 | if(bins){ |
697 | Int_t index = (input->GetCoord2()+1) * kNzBins + (input->GetCoord1()+1); | |
698 | bins[index].SetIndex(index); | |
699 | bins[index].SetMask(1); | |
700 | bins[index].SetQ(1); | |
701 | } | |
c391f9d9 | 702 | } |
703 | ||
5102d526 | 704 | delete [] binsSPDInit; |
705 | delete [] binsSPD; | |
706 | ||
c391f9d9 | 707 | Info("FindClustersSPD", "found clusters in ITS SPD: %d", nClustersSPD); |
708 | } | |
709 | ||
710 | ||
7f4044f0 | 711 | Bool_t AliITSclustererV2::IsMaximum(Int_t k,Int_t max,const AliBin *bins) { |
712 | //------------------------------------------------------------ | |
713 | //is this a local maximum ? | |
714 | //------------------------------------------------------------ | |
715 | UShort_t q=bins[k].GetQ(); | |
716 | if (q==1023) return kFALSE; | |
717 | if (bins[k-max].GetQ() > q) return kFALSE; | |
718 | if (bins[k-1 ].GetQ() > q) return kFALSE; | |
719 | if (bins[k+max].GetQ() > q) return kFALSE; | |
720 | if (bins[k+1 ].GetQ() > q) return kFALSE; | |
721 | if (bins[k-max-1].GetQ() > q) return kFALSE; | |
722 | if (bins[k+max-1].GetQ() > q) return kFALSE; | |
723 | if (bins[k+max+1].GetQ() > q) return kFALSE; | |
724 | if (bins[k-max+1].GetQ() > q) return kFALSE; | |
725 | return kTRUE; | |
726 | } | |
727 | ||
728 | void AliITSclustererV2:: | |
729 | FindPeaks(Int_t k,Int_t max,AliBin *b,Int_t *idx,UInt_t *msk,Int_t& n) { | |
730 | //------------------------------------------------------------ | |
731 | //find local maxima | |
732 | //------------------------------------------------------------ | |
733 | if (n<31) | |
734 | if (IsMaximum(k,max,b)) { | |
735 | idx[n]=k; msk[n]=(2<<n); | |
736 | n++; | |
737 | } | |
738 | b[k].SetMask(0); | |
739 | if (b[k-max].GetMask()&1) FindPeaks(k-max,max,b,idx,msk,n); | |
740 | if (b[k-1 ].GetMask()&1) FindPeaks(k-1 ,max,b,idx,msk,n); | |
741 | if (b[k+max].GetMask()&1) FindPeaks(k+max,max,b,idx,msk,n); | |
742 | if (b[k+1 ].GetMask()&1) FindPeaks(k+1 ,max,b,idx,msk,n); | |
743 | } | |
744 | ||
745 | void AliITSclustererV2:: | |
746 | MarkPeak(Int_t k, Int_t max, AliBin *bins, UInt_t m) { | |
747 | //------------------------------------------------------------ | |
748 | //mark this peak | |
749 | //------------------------------------------------------------ | |
750 | UShort_t q=bins[k].GetQ(); | |
751 | ||
752 | bins[k].SetMask(bins[k].GetMask()|m); | |
753 | ||
754 | if (bins[k-max].GetQ() <= q) | |
755 | if ((bins[k-max].GetMask()&m) == 0) MarkPeak(k-max,max,bins,m); | |
756 | if (bins[k-1 ].GetQ() <= q) | |
757 | if ((bins[k-1 ].GetMask()&m) == 0) MarkPeak(k-1 ,max,bins,m); | |
758 | if (bins[k+max].GetQ() <= q) | |
759 | if ((bins[k+max].GetMask()&m) == 0) MarkPeak(k+max,max,bins,m); | |
760 | if (bins[k+1 ].GetQ() <= q) | |
761 | if ((bins[k+1 ].GetMask()&m) == 0) MarkPeak(k+1 ,max,bins,m); | |
762 | } | |
763 | ||
764 | void AliITSclustererV2:: | |
765 | MakeCluster(Int_t k,Int_t max,AliBin *bins,UInt_t m,AliITSclusterV2 &c) { | |
766 | //------------------------------------------------------------ | |
767 | //make cluster using digits of this peak | |
768 | //------------------------------------------------------------ | |
769 | Float_t q=(Float_t)bins[k].GetQ(); | |
770 | Int_t i=k/max, j=k-i*max; | |
771 | ||
772 | c.SetQ(c.GetQ()+q); | |
773 | c.SetY(c.GetY()+i*q); | |
774 | c.SetZ(c.GetZ()+j*q); | |
775 | c.SetSigmaY2(c.GetSigmaY2()+i*i*q); | |
776 | c.SetSigmaZ2(c.GetSigmaZ2()+j*j*q); | |
777 | ||
778 | bins[k].SetMask(0xFFFFFFFE); | |
779 | ||
780 | if (bins[k-max].GetMask() == m) MakeCluster(k-max,max,bins,m,c); | |
781 | if (bins[k-1 ].GetMask() == m) MakeCluster(k-1 ,max,bins,m,c); | |
782 | if (bins[k+max].GetMask() == m) MakeCluster(k+max,max,bins,m,c); | |
783 | if (bins[k+1 ].GetMask() == m) MakeCluster(k+1 ,max,bins,m,c); | |
784 | } | |
785 | ||
786 | void AliITSclustererV2:: | |
c391f9d9 | 787 | FindClustersSDD(AliBin* bins[2], Int_t nMaxBin, Int_t nzBins, |
788 | const TClonesArray *digits, TClonesArray *clusters) { | |
7f4044f0 | 789 | //------------------------------------------------------------ |
790 | // Actual SDD cluster finder | |
791 | //------------------------------------------------------------ | |
7f4044f0 | 792 | Int_t ncl=0; TClonesArray &cl=*clusters; |
793 | for (Int_t s=0; s<2; s++) | |
c391f9d9 | 794 | for (Int_t i=0; i<nMaxBin; i++) { |
7f4044f0 | 795 | if (bins[s][i].IsUsed()) continue; |
796 | Int_t idx[32]; UInt_t msk[32]; Int_t npeaks=0; | |
c391f9d9 | 797 | FindPeaks(i, nzBins, bins[s], idx, msk, npeaks); |
7f4044f0 | 798 | |
799 | if (npeaks>30) continue; | |
e43c066c | 800 | if (npeaks==0) continue; |
7f4044f0 | 801 | |
802 | Int_t k,l; | |
803 | for (k=0; k<npeaks-1; k++){//mark adjacent peaks | |
804 | if (idx[k] < 0) continue; //this peak is already removed | |
805 | for (l=k+1; l<npeaks; l++) { | |
806 | if (idx[l] < 0) continue; //this peak is already removed | |
c391f9d9 | 807 | Int_t ki=idx[k]/nzBins, kj=idx[k] - ki*nzBins; |
808 | Int_t li=idx[l]/nzBins, lj=idx[l] - li*nzBins; | |
7f4044f0 | 809 | Int_t di=TMath::Abs(ki - li); |
810 | Int_t dj=TMath::Abs(kj - lj); | |
811 | if (di>1 || dj>1) continue; | |
812 | if (bins[s][idx[k]].GetQ() > bins[s][idx[l]].GetQ()) { | |
813 | msk[l]=msk[k]; | |
814 | idx[l]*=-1; | |
815 | } else { | |
816 | msk[k]=msk[l]; | |
817 | idx[k]*=-1; | |
818 | break; | |
819 | } | |
820 | } | |
821 | } | |
822 | ||
823 | for (k=0; k<npeaks; k++) { | |
c391f9d9 | 824 | MarkPeak(TMath::Abs(idx[k]), nzBins, bins[s], msk[k]); |
7f4044f0 | 825 | } |
826 | ||
827 | for (k=0; k<npeaks; k++) { | |
828 | if (idx[k] < 0) continue; //removed peak | |
829 | AliITSclusterV2 c; | |
c391f9d9 | 830 | MakeCluster(idx[k], nzBins, bins[s], msk[k], c); |
babd135a | 831 | //mi change |
832 | Int_t milab[10]; | |
833 | for (Int_t ilab=0;ilab<10;ilab++){ | |
834 | milab[ilab]=-2; | |
835 | } | |
e43c066c | 836 | Int_t maxi=0,mini=0,maxj=0,minj=0; |
837 | //AliBin *bmax=&bins[s][idx[k]]; | |
838 | //Float_t max = TMath::Max(TMath::Abs(bmax->GetQ())/5.,3.); | |
839 | Float_t max=3; | |
840 | for (Int_t di=-2; di<=2;di++) | |
841 | for (Int_t dj=-3;dj<=3;dj++){ | |
842 | Int_t index = idx[k]+di+dj*nzBins; | |
843 | if (index<0) continue; | |
844 | if (index>=nMaxBin) continue; | |
845 | AliBin *b=&bins[s][index]; | |
846 | if (TMath::Abs(b->GetQ())>max){ | |
847 | if (di>maxi) maxi=di; | |
848 | if (di<mini) mini=di; | |
849 | if (dj>maxj) maxj=dj; | |
850 | if (dj<minj) minj=dj; | |
851 | // | |
0e986ef9 | 852 | if(digits) { |
853 | if (TMath::Abs(di)<2&&TMath::Abs(dj)<2){ | |
854 | AliITSdigitSDD* d=(AliITSdigitSDD*)digits->UncheckedAt(b->GetIndex()); | |
855 | for (Int_t itrack=0;itrack<10;itrack++){ | |
856 | Int_t track = (d->GetTracks())[itrack]; | |
857 | if (track>=0) { | |
858 | AddLabel(milab, track); | |
859 | } | |
e43c066c | 860 | } |
861 | } | |
862 | } | |
863 | } | |
864 | } | |
865 | ||
866 | /* | |
867 | Float_t s2 = c.GetSigmaY2()/c.GetQ() - c.GetY()*c.GetY(); | |
868 | Float_t w=par->GetPadPitchWidth(sec); | |
869 | c.SetSigmaY2(s2); | |
870 | if (s2 != 0.) { | |
871 | c.SetSigmaY2(c.GetSigmaY2()*0.108); | |
872 | if (sec<par->GetNInnerSector()) c.SetSigmaY2(c.GetSigmaY2()*2.07); | |
873 | } | |
874 | s2 = c.GetSigmaZ2()/c.GetQ() - c.GetZ()*c.GetZ(); | |
875 | w=par->GetZWidth(); | |
876 | c.SetSigmaZ2(s2); | |
877 | ||
878 | if (s2 != 0.) { | |
879 | c.SetSigmaZ2(c.GetSigmaZ2()*0.169); | |
880 | if (sec<par->GetNInnerSector()) c.SetSigmaZ2(c.GetSigmaZ2()*1.77); | |
881 | } | |
7f4044f0 | 882 | */ |
883 | ||
7f4044f0 | 884 | Float_t y=c.GetY(),z=c.GetZ(), q=c.GetQ(); |
885 | y/=q; z/=q; | |
e43c066c | 886 | // |
887 | //Float_t s2 = c.GetSigmaY2()/c.GetQ() - y*y; | |
888 | // c.SetSigmaY2(s2); | |
889 | //s2 = c.GetSigmaZ2()/c.GetQ() - z*z; | |
890 | //c.SetSigmaZ2(s2); | |
891 | // | |
7f4044f0 | 892 | y=(y-0.5)*fYpitchSDD; |
893 | y-=fHwSDD; | |
894 | y-=fYoffSDD; //delay ? | |
895 | if (s) y=-y; | |
896 | ||
897 | z=(z-0.5)*fZpitchSDD; | |
898 | z-=fHlSDD; | |
899 | ||
f363d377 | 900 | y=-(-y+fYshift[fI]); |
901 | z= -z+fZshift[fI]; | |
ecb9da3c | 902 | |
903 | q/=12.7; //this WAS consistent with SSD. To be reassessed | |
904 | // 23-MAR-2007 | |
905 | Float_t hit[5] = {y, z, 0.0030*0.0030, 0.0020*0.0020, q}; | |
906 | Int_t info[3] = {maxj-minj+1, maxi-mini+1, fNlayer[fI]}; | |
e3d91d99 | 907 | |
908 | if (c.GetQ() < 20.) continue; //noise cluster | |
e43c066c | 909 | |
910 | if (digits) { | |
911 | // AliBin *b=&bins[s][idx[k]]; | |
912 | // AliITSdigitSDD* d=(AliITSdigitSDD*)digits->UncheckedAt(b->GetIndex()); | |
c391f9d9 | 913 | { |
e43c066c | 914 | //Int_t lab[3]; |
915 | //lab[0]=(d->GetTracks())[0]; | |
916 | //lab[1]=(d->GetTracks())[1]; | |
917 | //lab[2]=(d->GetTracks())[2]; | |
918 | //CheckLabels(lab); | |
babd135a | 919 | CheckLabels2(milab); |
c391f9d9 | 920 | } |
921 | } | |
ecb9da3c | 922 | milab[3]=fNdet[fI]; |
923 | ||
924 | AliITSclusterV2 *cc = new (cl[ncl]) AliITSclusterV2(milab,hit,info); | |
925 | cc->SetType(npeaks); | |
926 | ncl++; | |
7f4044f0 | 927 | } |
928 | } | |
c391f9d9 | 929 | } |
930 | ||
931 | void AliITSclustererV2:: | |
932 | FindClustersSDD(const TClonesArray *digits, TClonesArray *clusters) { | |
933 | //------------------------------------------------------------ | |
934 | // Actual SDD cluster finder | |
935 | //------------------------------------------------------------ | |
936 | Int_t kNzBins = fNzSDD + 2; | |
937 | const Int_t kMAXBIN=kNzBins*(fNySDD+2); | |
938 | ||
939 | AliBin *bins[2]; | |
940 | bins[0]=new AliBin[kMAXBIN]; | |
941 | bins[1]=new AliBin[kMAXBIN]; | |
942 | ||
943 | AliITSdigitSDD *d=0; | |
944 | Int_t i, ndigits=digits->GetEntriesFast(); | |
945 | for (i=0; i<ndigits; i++) { | |
946 | d=(AliITSdigitSDD*)digits->UncheckedAt(i); | |
947 | Int_t y=d->GetCoord2()+1; //y | |
948 | Int_t z=d->GetCoord1()+1; //z | |
949 | Int_t q=d->GetSignal(); | |
e43c066c | 950 | if (q<3) continue; |
e3d91d99 | 951 | |
c391f9d9 | 952 | if (z <= fNzSDD) { |
953 | bins[0][y*kNzBins+z].SetQ(q); | |
954 | bins[0][y*kNzBins+z].SetMask(1); | |
955 | bins[0][y*kNzBins+z].SetIndex(i); | |
956 | } else { | |
957 | z-=fNzSDD; | |
958 | bins[1][y*kNzBins+z].SetQ(q); | |
959 | bins[1][y*kNzBins+z].SetMask(1); | |
960 | bins[1][y*kNzBins+z].SetIndex(i); | |
961 | } | |
962 | } | |
963 | ||
964 | FindClustersSDD(bins, kMAXBIN, kNzBins, digits, clusters); | |
7f4044f0 | 965 | |
966 | delete[] bins[0]; | |
967 | delete[] bins[1]; | |
0e986ef9 | 968 | |
7f4044f0 | 969 | } |
970 | ||
c391f9d9 | 971 | void AliITSclustererV2::FindClustersSDD(AliITSRawStream* input, |
972 | TClonesArray** clusters) | |
973 | { | |
974 | //------------------------------------------------------------ | |
975 | // Actual SDD cluster finder for raw data | |
976 | //------------------------------------------------------------ | |
977 | Int_t nClustersSDD = 0; | |
978 | Int_t kNzBins = fNzSDD + 2; | |
979 | Int_t kMaxBin = kNzBins * (fNySDD+2); | |
5102d526 | 980 | AliBin *binsSDDInit = new AliBin[kMaxBin]; |
981 | AliBin *binsSDD1 = new AliBin[kMaxBin]; | |
982 | AliBin *binsSDD2 = new AliBin[kMaxBin]; | |
983 | AliBin *bins[2] = {NULL, NULL}; | |
c391f9d9 | 984 | |
985 | // read raw data input stream | |
986 | while (kTRUE) { | |
987 | Bool_t next = input->Next(); | |
988 | if (!next || input->IsNewModule()) { | |
989 | Int_t iModule = input->GetPrevModuleID(); | |
990 | ||
991 | // when all data from a module was read, search for clusters | |
992 | if (bins[0]) { | |
993 | clusters[iModule] = new TClonesArray("AliITSclusterV2"); | |
994 | fI = iModule; | |
995 | FindClustersSDD(bins, kMaxBin, kNzBins, NULL, clusters[iModule]); | |
996 | Int_t nClusters = clusters[iModule]->GetEntriesFast(); | |
997 | nClustersSDD += nClusters; | |
5102d526 | 998 | bins[0] = bins[1] = NULL; |
c391f9d9 | 999 | } |
1000 | ||
1001 | if (!next) break; | |
5102d526 | 1002 | bins[0]=binsSDD1; |
1003 | bins[1]=binsSDD2; | |
1004 | memcpy(binsSDD1,binsSDDInit,sizeof(AliBin)*kMaxBin); | |
1005 | memcpy(binsSDD2,binsSDDInit,sizeof(AliBin)*kMaxBin); | |
c391f9d9 | 1006 | } |
1007 | ||
1008 | // fill the current digit into the bins array | |
0e986ef9 | 1009 | if(input->GetSignal()>=3) { |
1010 | Int_t iz = input->GetCoord1()+1; | |
1011 | Int_t side = ((iz <= fNzSDD) ? 0 : 1); | |
1012 | iz -= side*fNzSDD; | |
1013 | Int_t index = (input->GetCoord2()+1) * kNzBins + iz; | |
1014 | bins[side][index].SetQ(input->GetSignal()); | |
1015 | bins[side][index].SetMask(1); | |
1016 | bins[side][index].SetIndex(index); | |
1017 | } | |
c391f9d9 | 1018 | } |
1019 | ||
5102d526 | 1020 | delete[] binsSDD1; |
1021 | delete[] binsSDD2; | |
1022 | delete[] binsSDDInit; | |
1023 | ||
c391f9d9 | 1024 | Info("FindClustersSDD", "found clusters in ITS SDD: %d", nClustersSDD); |
1025 | } | |
1026 | ||
e43c066c | 1027 | |
1028 | ||
c391f9d9 | 1029 | void AliITSclustererV2:: |
1030 | FindClustersSSD(Ali1Dcluster* neg, Int_t nn, | |
1031 | Ali1Dcluster* pos, Int_t np, | |
1032 | TClonesArray *clusters) { | |
1033 | //------------------------------------------------------------ | |
1034 | // Actual SSD cluster finder | |
1035 | //------------------------------------------------------------ | |
1036 | TClonesArray &cl=*clusters; | |
e43c066c | 1037 | // |
c391f9d9 | 1038 | Float_t tanp=fTanP, tann=fTanN; |
1039 | if (fI>fLastSSD1) {tann=fTanP; tanp=fTanN;} | |
c391f9d9 | 1040 | Int_t idet=fNdet[fI]; |
1041 | Int_t ncl=0; | |
e43c066c | 1042 | // |
1043 | Int_t negativepair[30000]; | |
1044 | Int_t cnegative[3000]; | |
1045 | Int_t cused1[3000]; | |
1046 | Int_t positivepair[30000]; | |
1047 | Int_t cpositive[3000]; | |
1048 | Int_t cused2[3000]; | |
1049 | for (Int_t i=0;i<3000;i++) {cnegative[i]=0; cused1[i]=0;} | |
1050 | for (Int_t i=0;i<3000;i++) {cpositive[i]=0; cused2[i]=0;} | |
b66f90a0 | 1051 | for (Int_t i=0;i<30000;i++){negativepair[i]=positivepair[i]=0;} |
0774985e | 1052 | static Short_t pairs[1000][1000]; |
1053 | memset(pairs,0,sizeof(Short_t)*1000000); | |
1054 | // Short_t ** pairs = new Short_t*[1000]; | |
1055 | // for (Int_t i=0; i<1000; i++) { | |
1056 | // pairs[i] = new Short_t[1000]; | |
1057 | // memset(pairs[i],0,sizeof(Short_t)*1000); | |
1058 | // } | |
e43c066c | 1059 | // |
1060 | // find available pairs | |
1061 | // | |
1062 | for (Int_t i=0; i<np; i++) { | |
1063 | Float_t yp=pos[i].GetY()*fYpitchSSD; | |
1064 | if (pos[i].GetQ()<3) continue; | |
1065 | for (Int_t j=0; j<nn; j++) { | |
1066 | if (neg[j].GetQ()<3) continue; | |
1067 | Float_t yn=neg[j].GetY()*fYpitchSSD; | |
1068 | Float_t zt=(2*fHlSSD*tanp + yp - yn)/(tann+tanp); | |
1069 | Float_t yt=yn + tann*zt; | |
1070 | zt-=fHlSSD; yt-=fHwSSD; | |
1071 | if (TMath::Abs(yt)<fHwSSD+0.01) | |
1072 | if (TMath::Abs(zt)<fHlSSD+0.01*(neg[j].GetNd()+pos[i].GetNd())) { | |
1073 | negativepair[i*10+cnegative[i]] =j; //index | |
1074 | positivepair[j*10+cpositive[j]] =i; | |
1075 | cnegative[i]++; //counters | |
1076 | cpositive[j]++; | |
1077 | pairs[i][j]=100; | |
1078 | } | |
1079 | } | |
1080 | } | |
1081 | // | |
1082 | for (Int_t i=0; i<np; i++) { | |
1083 | Float_t yp=pos[i].GetY()*fYpitchSSD; | |
1084 | if (pos[i].GetQ()<3) continue; | |
1085 | for (Int_t j=0; j<nn; j++) { | |
1086 | if (neg[j].GetQ()<3) continue; | |
1087 | if (cpositive[j]&&cnegative[i]) continue; | |
1088 | Float_t yn=neg[j].GetY()*fYpitchSSD; | |
1089 | Float_t zt=(2*fHlSSD*tanp + yp - yn)/(tann+tanp); | |
1090 | Float_t yt=yn + tann*zt; | |
1091 | zt-=fHlSSD; yt-=fHwSSD; | |
1092 | if (TMath::Abs(yt)<fHwSSD+0.1) | |
1093 | if (TMath::Abs(zt)<fHlSSD+0.15) { | |
1094 | if (cnegative[i]==0) pos[i].SetNd(100); // not available pair | |
1095 | if (cpositive[j]==0) neg[j].SetNd(100); // not available pair | |
1096 | negativepair[i*10+cnegative[i]] =j; //index | |
1097 | positivepair[j*10+cpositive[j]] =i; | |
1098 | cnegative[i]++; //counters | |
1099 | cpositive[j]++; | |
1100 | pairs[i][j]=100; | |
1101 | } | |
1102 | } | |
1103 | } | |
1104 | // | |
1105 | Float_t lp[5]; | |
1106 | Int_t milab[10]; | |
1107 | Double_t ratio; | |
1108 | ||
1109 | // | |
1110 | // sign gold tracks | |
1111 | // | |
1112 | for (Int_t ip=0;ip<np;ip++){ | |
1113 | Float_t ybest=1000,zbest=1000,qbest=0; | |
1114 | // | |
1115 | // select gold clusters | |
1116 | if ( (cnegative[ip]==1) && cpositive[negativepair[10*ip]]==1){ | |
1117 | Float_t yp=pos[ip].GetY()*fYpitchSSD; | |
1118 | Int_t j = negativepair[10*ip]; | |
1119 | ratio = (pos[ip].GetQ()-neg[j].GetQ())/(pos[ip].GetQ()+neg[j].GetQ()); | |
1120 | // | |
1121 | Float_t yn=neg[j].GetY()*fYpitchSSD; | |
1122 | Float_t zt=(2*fHlSSD*tanp + yp - yn)/(tann+tanp); | |
1123 | Float_t yt=yn + tann*zt; | |
1124 | zt-=fHlSSD; yt-=fHwSSD; | |
1125 | ybest=yt; zbest=zt; | |
1126 | qbest=0.5*(pos[ip].GetQ()+neg[j].GetQ()); | |
1127 | lp[0]=-(-ybest+fYshift[fI]); | |
1128 | lp[1]= -zbest+fZshift[fI]; | |
1129 | lp[2]=0.0025*0.0025; //SigmaY2 | |
1130 | lp[3]=0.110*0.110; //SigmaZ2 | |
1131 | ||
1132 | lp[4]=qbest; //Q | |
1133 | for (Int_t ilab=0;ilab<10;ilab++) milab[ilab]=-2; | |
1134 | for (Int_t ilab=0;ilab<3;ilab++){ | |
1135 | milab[ilab] = pos[ip].GetLabel(ilab); | |
1136 | milab[ilab+3] = neg[j].GetLabel(ilab); | |
1137 | } | |
1138 | // | |
1139 | CheckLabels2(milab); | |
1140 | milab[3]=(((ip<<10) + j)<<10) + idet; // pos|neg|det | |
1141 | Int_t info[3] = {pos[ip].GetNd(),neg[j].GetNd(),fNlayer[fI]}; | |
1142 | AliITSclusterV2 * cl2 = new (cl[ncl]) AliITSclusterV2(milab,lp,info); | |
1143 | ncl++; | |
1144 | cl2->SetChargeRatio(ratio); | |
1145 | cl2->SetType(1); | |
1146 | pairs[ip][j]=1; | |
1147 | if ((pos[ip].GetNd()+neg[j].GetNd())>6){ //multi cluster | |
1148 | cl2->SetType(2); | |
1149 | pairs[ip][j]=2; | |
1150 | } | |
1151 | cused1[ip]++; | |
1152 | cused2[j]++; | |
1153 | } | |
1154 | } | |
1155 | ||
1156 | for (Int_t ip=0;ip<np;ip++){ | |
1157 | Float_t ybest=1000,zbest=1000,qbest=0; | |
1158 | // | |
1159 | // | |
1160 | // select "silber" cluster | |
1161 | if ( cnegative[ip]==1 && cpositive[negativepair[10*ip]]==2){ | |
1162 | Int_t in = negativepair[10*ip]; | |
1163 | Int_t ip2 = positivepair[10*in]; | |
1164 | if (ip2==ip) ip2 = positivepair[10*in+1]; | |
1165 | Float_t pcharge = pos[ip].GetQ()+pos[ip2].GetQ(); | |
1166 | if (TMath::Abs(pcharge-neg[in].GetQ())<10){ | |
1167 | // | |
1168 | // add first pair | |
1169 | if (pairs[ip][in]==100){ // | |
1170 | Float_t yp=pos[ip].GetY()*fYpitchSSD; | |
1171 | Float_t yn=neg[in].GetY()*fYpitchSSD; | |
1172 | Float_t zt=(2*fHlSSD*tanp + yp - yn)/(tann+tanp); | |
1173 | Float_t yt=yn + tann*zt; | |
1174 | zt-=fHlSSD; yt-=fHwSSD; | |
1175 | ybest =yt; zbest=zt; | |
1176 | qbest =pos[ip].GetQ(); | |
1177 | lp[0]=-(-ybest+fYshift[fI]); | |
1178 | lp[1]= -zbest+fZshift[fI]; | |
1179 | lp[2]=0.0025*0.0025; //SigmaY2 | |
1180 | lp[3]=0.110*0.110; //SigmaZ2 | |
1181 | ||
1182 | lp[4]=qbest; //Q | |
1183 | for (Int_t ilab=0;ilab<10;ilab++) milab[ilab]=-2; | |
1184 | for (Int_t ilab=0;ilab<3;ilab++){ | |
1185 | milab[ilab] = pos[ip].GetLabel(ilab); | |
1186 | milab[ilab+3] = neg[in].GetLabel(ilab); | |
1187 | } | |
1188 | // | |
1189 | CheckLabels2(milab); | |
1190 | ratio = (pos[ip].GetQ()-neg[in].GetQ())/(pos[ip].GetQ()+neg[in].GetQ()); | |
1191 | milab[3]=(((ip<<10) + in)<<10) + idet; // pos|neg|det | |
1192 | Int_t info[3] = {pos[ip].GetNd(),neg[in].GetNd(),fNlayer[fI]}; | |
1193 | AliITSclusterV2 * cl2 = new (cl[ncl]) AliITSclusterV2(milab,lp,info); | |
1194 | ncl++; | |
1195 | cl2->SetChargeRatio(ratio); | |
1196 | cl2->SetType(5); | |
1197 | pairs[ip][in] = 5; | |
1198 | if ((pos[ip].GetNd()+neg[in].GetNd())>6){ //multi cluster | |
1199 | cl2->SetType(6); | |
1200 | pairs[ip][in] = 6; | |
1201 | } | |
1202 | } | |
1203 | // | |
1204 | // add second pair | |
1205 | ||
1206 | // if (!(cused1[ip2] || cused2[in])){ // | |
1207 | if (pairs[ip2][in]==100){ | |
1208 | Float_t yp=pos[ip2].GetY()*fYpitchSSD; | |
1209 | Float_t yn=neg[in].GetY()*fYpitchSSD; | |
1210 | Float_t zt=(2*fHlSSD*tanp + yp - yn)/(tann+tanp); | |
1211 | Float_t yt=yn + tann*zt; | |
1212 | zt-=fHlSSD; yt-=fHwSSD; | |
1213 | ybest =yt; zbest=zt; | |
1214 | qbest =pos[ip2].GetQ(); | |
1215 | lp[0]=-(-ybest+fYshift[fI]); | |
1216 | lp[1]= -zbest+fZshift[fI]; | |
1217 | lp[2]=0.0025*0.0025; //SigmaY2 | |
1218 | lp[3]=0.110*0.110; //SigmaZ2 | |
1219 | ||
1220 | lp[4]=qbest; //Q | |
1221 | for (Int_t ilab=0;ilab<10;ilab++) milab[ilab]=-2; | |
1222 | for (Int_t ilab=0;ilab<3;ilab++){ | |
1223 | milab[ilab] = pos[ip2].GetLabel(ilab); | |
1224 | milab[ilab+3] = neg[in].GetLabel(ilab); | |
1225 | } | |
1226 | // | |
1227 | CheckLabels2(milab); | |
1228 | ratio = (pos[ip2].GetQ()-neg[in].GetQ())/(pos[ip2].GetQ()+neg[in].GetQ()); | |
1229 | milab[3]=(((ip2<<10) + in)<<10) + idet; // pos|neg|det | |
1230 | Int_t info[3] = {pos[ip2].GetNd(),neg[in].GetNd(),fNlayer[fI]}; | |
1231 | AliITSclusterV2 *cl2 = new (cl[ncl]) AliITSclusterV2(milab,lp,info); | |
1232 | ncl++; | |
1233 | cl2->SetChargeRatio(ratio); | |
1234 | cl2->SetType(5); | |
1235 | pairs[ip2][in] =5; | |
1236 | if ((pos[ip2].GetNd()+neg[in].GetNd())>6){ //multi cluster | |
1237 | cl2->SetType(6); | |
1238 | pairs[ip2][in] =6; | |
1239 | } | |
1240 | } | |
1241 | cused1[ip]++; | |
1242 | cused1[ip2]++; | |
1243 | cused2[in]++; | |
1244 | } | |
1245 | } | |
1246 | } | |
1247 | ||
1248 | // | |
1249 | for (Int_t jn=0;jn<nn;jn++){ | |
1250 | if (cused2[jn]) continue; | |
1251 | Float_t ybest=1000,zbest=1000,qbest=0; | |
1252 | // select "silber" cluster | |
1253 | if ( cpositive[jn]==1 && cnegative[positivepair[10*jn]]==2){ | |
1254 | Int_t ip = positivepair[10*jn]; | |
1255 | Int_t jn2 = negativepair[10*ip]; | |
1256 | if (jn2==jn) jn2 = negativepair[10*ip+1]; | |
1257 | Float_t pcharge = neg[jn].GetQ()+neg[jn2].GetQ(); | |
1258 | // | |
1259 | if (TMath::Abs(pcharge-pos[ip].GetQ())<10){ | |
1260 | // | |
1261 | // add first pair | |
1262 | // if (!(cused1[ip]||cused2[jn])){ | |
1263 | if (pairs[ip][jn]==100){ | |
1264 | Float_t yn=neg[jn].GetY()*fYpitchSSD; | |
1265 | Float_t yp=pos[ip].GetY()*fYpitchSSD; | |
1266 | Float_t zt=(2*fHlSSD*tanp + yp - yn)/(tann+tanp); | |
1267 | Float_t yt=yn + tann*zt; | |
1268 | zt-=fHlSSD; yt-=fHwSSD; | |
1269 | ybest =yt; zbest=zt; | |
1270 | qbest =neg[jn].GetQ(); | |
1271 | lp[0]=-(-ybest+fYshift[fI]); | |
1272 | lp[1]= -zbest+fZshift[fI]; | |
1273 | lp[2]=0.0025*0.0025; //SigmaY2 | |
1274 | lp[3]=0.110*0.110; //SigmaZ2 | |
1275 | ||
1276 | lp[4]=qbest; //Q | |
1277 | for (Int_t ilab=0;ilab<10;ilab++) milab[ilab]=-2; | |
1278 | for (Int_t ilab=0;ilab<3;ilab++){ | |
1279 | milab[ilab] = pos[ip].GetLabel(ilab); | |
1280 | milab[ilab+3] = neg[jn].GetLabel(ilab); | |
1281 | } | |
1282 | // | |
1283 | CheckLabels2(milab); | |
1284 | ratio = (pos[ip].GetQ()-neg[jn].GetQ())/(pos[ip].GetQ()+neg[jn].GetQ()); | |
1285 | milab[3]=(((ip<<10) + jn)<<10) + idet; // pos|neg|det | |
1286 | Int_t info[3] = {pos[ip].GetNd(),neg[jn].GetNd(),fNlayer[fI]}; | |
1287 | AliITSclusterV2 * cl2 = new (cl[ncl]) AliITSclusterV2(milab,lp,info); | |
1288 | ncl++; | |
1289 | cl2->SetChargeRatio(ratio); | |
1290 | cl2->SetType(7); | |
1291 | pairs[ip][jn] =7; | |
1292 | if ((pos[ip].GetNd()+neg[jn].GetNd())>6){ //multi cluster | |
1293 | cl2->SetType(8); | |
1294 | pairs[ip][jn]=8; | |
1295 | } | |
1296 | } | |
1297 | // | |
1298 | // add second pair | |
1299 | // if (!(cused1[ip]||cused2[jn2])){ | |
1300 | if (pairs[ip][jn2]==100){ | |
1301 | Float_t yn=neg[jn2].GetY()*fYpitchSSD; | |
1302 | Double_t yp=pos[ip].GetY()*fYpitchSSD; | |
1303 | Double_t zt=(2*fHlSSD*tanp + yp - yn)/(tann+tanp); | |
1304 | Double_t yt=yn + tann*zt; | |
1305 | zt-=fHlSSD; yt-=fHwSSD; | |
1306 | ybest =yt; zbest=zt; | |
1307 | qbest =neg[jn2].GetQ(); | |
1308 | lp[0]=-(-ybest+fYshift[fI]); | |
1309 | lp[1]= -zbest+fZshift[fI]; | |
1310 | lp[2]=0.0025*0.0025; //SigmaY2 | |
1311 | lp[3]=0.110*0.110; //SigmaZ2 | |
1312 | ||
1313 | lp[4]=qbest; //Q | |
1314 | for (Int_t ilab=0;ilab<10;ilab++) milab[ilab]=-2; | |
1315 | for (Int_t ilab=0;ilab<3;ilab++){ | |
1316 | milab[ilab] = pos[ip].GetLabel(ilab); | |
1317 | milab[ilab+3] = neg[jn2].GetLabel(ilab); | |
1318 | } | |
1319 | // | |
1320 | CheckLabels2(milab); | |
1321 | ratio = (pos[ip].GetQ()-neg[jn2].GetQ())/(pos[ip].GetQ()+neg[jn2].GetQ()); | |
1322 | milab[3]=(((ip<<10) + jn2)<<10) + idet; // pos|neg|det | |
1323 | Int_t info[3] = {pos[ip].GetNd(),neg[jn2].GetNd(),fNlayer[fI]}; | |
1324 | AliITSclusterV2* cl2 = new (cl[ncl]) AliITSclusterV2(milab,lp,info); | |
1325 | ncl++; | |
1326 | cl2->SetChargeRatio(ratio); | |
1327 | pairs[ip][jn2]=7; | |
1328 | cl2->SetType(7); | |
1329 | if ((pos[ip].GetNd()+neg[jn2].GetNd())>6){ //multi cluster | |
1330 | cl2->SetType(8); | |
1331 | pairs[ip][jn2]=8; | |
1332 | } | |
1333 | } | |
1334 | cused1[ip]++; | |
1335 | cused2[jn]++; | |
1336 | cused2[jn2]++; | |
1337 | } | |
1338 | } | |
1339 | } | |
1340 | ||
1341 | for (Int_t ip=0;ip<np;ip++){ | |
1342 | Float_t ybest=1000,zbest=1000,qbest=0; | |
1343 | // | |
1344 | // 2x2 clusters | |
1345 | // | |
1346 | if ( (cnegative[ip]<5) && cpositive[negativepair[10*ip]]<5){ | |
1347 | Float_t minchargediff =4.; | |
1348 | Int_t j=-1; | |
1349 | for (Int_t di=0;di<cnegative[ip];di++){ | |
1350 | Int_t jc = negativepair[ip*10+di]; | |
1351 | Float_t chargedif = pos[ip].GetQ()-neg[jc].GetQ(); | |
1352 | if (TMath::Abs(chargedif)<minchargediff){ | |
1353 | j =jc; | |
1354 | minchargediff = TMath::Abs(chargedif); | |
1355 | } | |
1356 | } | |
1357 | if (j<0) continue; // not proper cluster | |
1358 | Int_t count =0; | |
1359 | for (Int_t di=0;di<cnegative[ip];di++){ | |
1360 | Int_t jc = negativepair[ip*10+di]; | |
1361 | Float_t chargedif = pos[ip].GetQ()-neg[jc].GetQ(); | |
1362 | if (TMath::Abs(chargedif)<minchargediff+3.) count++; | |
1363 | } | |
1364 | if (count>1) continue; // more than one "proper" cluster for positive | |
1365 | // | |
1366 | count =0; | |
1367 | for (Int_t dj=0;dj<cpositive[j];dj++){ | |
1368 | Int_t ic = positivepair[j*10+dj]; | |
1369 | Float_t chargedif = pos[ic].GetQ()-neg[j].GetQ(); | |
1370 | if (TMath::Abs(chargedif)<minchargediff+3.) count++; | |
1371 | } | |
1372 | if (count>1) continue; // more than one "proper" cluster for negative | |
1373 | ||
1374 | Int_t jp = 0; | |
1375 | ||
1376 | count =0; | |
1377 | for (Int_t dj=0;dj<cnegative[jp];dj++){ | |
1378 | Int_t ic = positivepair[jp*10+dj]; | |
1379 | Float_t chargedif = pos[ic].GetQ()-neg[jp].GetQ(); | |
1380 | if (TMath::Abs(chargedif)<minchargediff+4.) count++; | |
1381 | } | |
1382 | if (count>1) continue; | |
1383 | if (pairs[ip][j]<100) continue; | |
1384 | // | |
1385 | //almost gold clusters | |
1386 | Float_t yp=pos[ip].GetY()*fYpitchSSD; | |
1387 | Float_t yn=neg[j].GetY()*fYpitchSSD; | |
1388 | Float_t zt=(2*fHlSSD*tanp + yp - yn)/(tann+tanp); | |
1389 | Float_t yt=yn + tann*zt; | |
1390 | zt-=fHlSSD; yt-=fHwSSD; | |
1391 | ybest=yt; zbest=zt; | |
1392 | qbest=0.5*(pos[ip].GetQ()+neg[j].GetQ()); | |
1393 | lp[0]=-(-ybest+fYshift[fI]); | |
1394 | lp[1]= -zbest+fZshift[fI]; | |
1395 | lp[2]=0.0025*0.0025; //SigmaY2 | |
1396 | lp[3]=0.110*0.110; //SigmaZ2 | |
1397 | lp[4]=qbest; //Q | |
1398 | for (Int_t ilab=0;ilab<10;ilab++) milab[ilab]=-2; | |
1399 | for (Int_t ilab=0;ilab<3;ilab++){ | |
1400 | milab[ilab] = pos[ip].GetLabel(ilab); | |
1401 | milab[ilab+3] = neg[j].GetLabel(ilab); | |
1402 | } | |
1403 | // | |
1404 | CheckLabels2(milab); | |
1405 | ratio = (pos[ip].GetQ()-neg[j].GetQ())/(pos[ip].GetQ()+neg[j].GetQ()); | |
1406 | milab[3]=(((ip<<10) + j)<<10) + idet; // pos|neg|det | |
1407 | Int_t info[3] = {pos[ip].GetNd(),neg[j].GetNd(),fNlayer[fI]}; | |
1408 | AliITSclusterV2 * cl2 = new (cl[ncl]) AliITSclusterV2(milab,lp,info); | |
1409 | ncl++; | |
1410 | cl2->SetChargeRatio(ratio); | |
1411 | cl2->SetType(10); | |
1412 | pairs[ip][j]=10; | |
1413 | if ((pos[ip].GetNd()+neg[j].GetNd())>6){ //multi cluster | |
1414 | cl2->SetType(11); | |
1415 | pairs[ip][j]=11; | |
1416 | } | |
1417 | cused1[ip]++; | |
1418 | cused2[j]++; | |
1419 | } | |
1420 | ||
1421 | } | |
1422 | ||
1423 | // | |
c391f9d9 | 1424 | for (Int_t i=0; i<np; i++) { |
c391f9d9 | 1425 | Float_t ybest=1000,zbest=1000,qbest=0; |
1426 | Float_t yp=pos[i].GetY()*fYpitchSSD; | |
e43c066c | 1427 | if (pos[i].GetQ()<3) continue; |
c391f9d9 | 1428 | for (Int_t j=0; j<nn; j++) { |
e43c066c | 1429 | // for (Int_t di = 0;di<cpositive[i];di++){ |
1430 | // Int_t j = negativepair[10*i+di]; | |
1431 | if (neg[j].GetQ()<3) continue; | |
1432 | if (cused2[j]||cused1[i]) continue; | |
1433 | if (pairs[i][j]>0 &&pairs[i][j]<100) continue; | |
1434 | ratio = (pos[i].GetQ()-neg[j].GetQ())/(pos[i].GetQ()+neg[j].GetQ()); | |
c391f9d9 | 1435 | Float_t yn=neg[j].GetY()*fYpitchSSD; |
1436 | Float_t zt=(2*fHlSSD*tanp + yp - yn)/(tann+tanp); | |
1437 | Float_t yt=yn + tann*zt; | |
1438 | zt-=fHlSSD; yt-=fHwSSD; | |
1439 | if (TMath::Abs(yt)<fHwSSD+0.01) | |
e43c066c | 1440 | if (TMath::Abs(zt)<fHlSSD+0.01*(neg[j].GetNd()+pos[i].GetNd())) { |
c391f9d9 | 1441 | ybest=yt; zbest=zt; |
1442 | qbest=0.5*(pos[i].GetQ()+neg[j].GetQ()); | |
f363d377 | 1443 | lp[0]=-(-ybest+fYshift[fI]); |
1444 | lp[1]= -zbest+fZshift[fI]; | |
e43c066c | 1445 | lp[2]=0.0025*0.0025; //SigmaY2 |
1446 | lp[3]=0.110*0.110; //SigmaZ2 | |
1447 | ||
c391f9d9 | 1448 | lp[4]=qbest; //Q |
babd135a | 1449 | for (Int_t ilab=0;ilab<10;ilab++) milab[ilab]=-2; |
e43c066c | 1450 | for (Int_t ilab=0;ilab<3;ilab++){ |
1451 | milab[ilab] = pos[i].GetLabel(ilab); | |
1452 | milab[ilab+3] = neg[j].GetLabel(ilab); | |
1453 | } | |
babd135a | 1454 | // |
babd135a | 1455 | CheckLabels2(milab); |
1456 | milab[3]=(((i<<10) + j)<<10) + idet; // pos|neg|det | |
e43c066c | 1457 | Int_t info[3] = {pos[i].GetNd(),neg[j].GetNd(),fNlayer[fI]}; |
1458 | AliITSclusterV2 * cl2 = new (cl[ncl]) AliITSclusterV2(milab,lp,info); | |
1459 | ncl++; | |
1460 | cl2->SetChargeRatio(ratio); | |
1461 | cl2->SetType(100+cpositive[j]+cnegative[i]); | |
1462 | //cl2->SetType(0); | |
1463 | /* | |
1464 | if (pairs[i][j]<100){ | |
1465 | printf("problem:- %d\n", pairs[i][j]); | |
1466 | } | |
1467 | if (cnegative[i]<2&&cpositive[j]<2){ | |
1468 | printf("problem:- %d\n", pairs[i][j]); | |
1469 | } | |
1470 | */ | |
c391f9d9 | 1471 | } |
1472 | } | |
c391f9d9 | 1473 | } |
a06cb96e | 1474 | |
0774985e | 1475 | // for (Int_t i=0; i<1000; i++) delete [] pairs[i]; |
1476 | // delete [] pairs; | |
a06cb96e | 1477 | |
c391f9d9 | 1478 | } |
1479 | ||
e43c066c | 1480 | |
7f4044f0 | 1481 | void AliITSclustererV2:: |
e43c066c | 1482 | FindClustersSSD(const TClonesArray *alldigits, TClonesArray *clusters) { |
7f4044f0 | 1483 | //------------------------------------------------------------ |
1484 | // Actual SSD cluster finder | |
1485 | //------------------------------------------------------------ | |
e43c066c | 1486 | Int_t smaxall=alldigits->GetEntriesFast(); |
1487 | if (smaxall==0) return; | |
1488 | TObjArray *digits = new TObjArray; | |
1489 | for (Int_t i=0;i<smaxall; i++){ | |
1490 | AliITSdigitSSD *d=(AliITSdigitSSD*)alldigits->UncheckedAt(i); | |
1491 | if (d->GetSignal()<3) continue; | |
1492 | digits->AddLast(d); | |
1493 | } | |
1494 | Int_t smax = digits->GetEntriesFast(); | |
7f4044f0 | 1495 | if (smax==0) return; |
e43c066c | 1496 | |
42283fd4 | 1497 | const Int_t mMAX=1000; |
7f4044f0 | 1498 | Int_t np=0, nn=0; |
42283fd4 | 1499 | Ali1Dcluster pos[mMAX], neg[mMAX]; |
7f4044f0 | 1500 | Float_t y=0., q=0., qmax=0.; |
1501 | Int_t lab[4]={-2,-2,-2,-2}; | |
e43c066c | 1502 | |
7f4044f0 | 1503 | AliITSdigitSSD *d=(AliITSdigitSSD*)digits->UncheckedAt(0); |
1504 | q += d->GetSignal(); | |
1505 | y += d->GetCoord2()*d->GetSignal(); | |
1506 | qmax=d->GetSignal(); | |
1507 | lab[0]=d->GetTrack(0); lab[1]=d->GetTrack(1); lab[2]=d->GetTrack(2); | |
1508 | Int_t curr=d->GetCoord2(); | |
1509 | Int_t flag=d->GetCoord1(); | |
1510 | Int_t *n=&nn; | |
1511 | Ali1Dcluster *c=neg; | |
c391f9d9 | 1512 | Int_t nd=1; |
e43c066c | 1513 | Int_t milab[10]; |
1514 | for (Int_t ilab=0;ilab<10;ilab++){ | |
1515 | milab[ilab]=-2; | |
1516 | } | |
1517 | milab[0]=d->GetTrack(0); milab[1]=d->GetTrack(1); milab[2]=d->GetTrack(2); | |
1518 | ||
7f4044f0 | 1519 | for (Int_t s=1; s<smax; s++) { |
e43c066c | 1520 | d=(AliITSdigitSSD*)digits->UncheckedAt(s); |
7f4044f0 | 1521 | Int_t strip=d->GetCoord2(); |
1522 | if ((strip-curr) > 1 || flag!=d->GetCoord1()) { | |
1523 | c[*n].SetY(y/q); | |
1524 | c[*n].SetQ(q); | |
1525 | c[*n].SetNd(nd); | |
e43c066c | 1526 | CheckLabels2(milab); |
1527 | c[*n].SetLabels(milab); | |
7f4044f0 | 1528 | //Split suspiciously big cluster |
e43c066c | 1529 | /* |
1530 | if (nd>10&&nd<16){ | |
1531 | c[*n].SetY(y/q-0.3*nd); | |
1532 | c[*n].SetQ(0.5*q); | |
1533 | (*n)++; | |
42283fd4 | 1534 | if (*n==mMAX) { |
e43c066c | 1535 | Error("FindClustersSSD","Too many 1D clusters !"); |
7f4044f0 | 1536 | return; |
e43c066c | 1537 | } |
1538 | c[*n].SetY(y/q-0.0*nd); | |
1539 | c[*n].SetQ(0.5*q); | |
1540 | c[*n].SetNd(nd); | |
1541 | (*n)++; | |
42283fd4 | 1542 | if (*n==mMAX) { |
e43c066c | 1543 | Error("FindClustersSSD","Too many 1D clusters !"); |
1544 | return; | |
1545 | } | |
1546 | // | |
1547 | c[*n].SetY(y/q+0.3*nd); | |
1548 | c[*n].SetQ(0.5*q); | |
1549 | c[*n].SetNd(nd); | |
1550 | c[*n].SetLabels(milab); | |
1551 | } | |
1552 | else{ | |
1553 | */ | |
1554 | if (nd>4&&nd<25) { | |
1555 | c[*n].SetY(y/q-0.25*nd); | |
1556 | c[*n].SetQ(0.5*q); | |
1557 | (*n)++; | |
42283fd4 | 1558 | if (*n==mMAX) { |
e43c066c | 1559 | Error("FindClustersSSD","Too many 1D clusters !"); |
1560 | return; | |
1561 | } | |
1562 | c[*n].SetY(y/q+0.25*nd); | |
1563 | c[*n].SetQ(0.5*q); | |
1564 | c[*n].SetNd(nd); | |
1565 | c[*n].SetLabels(milab); | |
1566 | } | |
7f4044f0 | 1567 | (*n)++; |
42283fd4 | 1568 | if (*n==mMAX) { |
c630aafd | 1569 | Error("FindClustersSSD","Too many 1D clusters !"); |
7f4044f0 | 1570 | return; |
1571 | } | |
1572 | y=q=qmax=0.; | |
1573 | nd=0; | |
1574 | lab[0]=lab[1]=lab[2]=-2; | |
e43c066c | 1575 | // |
1576 | for (Int_t ilab=0;ilab<10;ilab++){ | |
1577 | milab[ilab]=-2; | |
1578 | } | |
1579 | // | |
7f4044f0 | 1580 | if (flag!=d->GetCoord1()) { n=&np; c=pos; } |
1581 | } | |
1582 | flag=d->GetCoord1(); | |
1583 | q += d->GetSignal(); | |
1584 | y += d->GetCoord2()*d->GetSignal(); | |
1585 | nd++; | |
1586 | if (d->GetSignal()>qmax) { | |
1587 | qmax=d->GetSignal(); | |
1588 | lab[0]=d->GetTrack(0); lab[1]=d->GetTrack(1); lab[2]=d->GetTrack(2); | |
1589 | } | |
e43c066c | 1590 | for (Int_t ilab=0;ilab<10;ilab++) { |
1591 | if (d->GetTrack(ilab)>=0) AddLabel(milab, (d->GetTrack(ilab))); | |
1592 | } | |
7f4044f0 | 1593 | curr=strip; |
1594 | } | |
1595 | c[*n].SetY(y/q); | |
1596 | c[*n].SetQ(q); | |
1597 | c[*n].SetNd(nd); | |
1598 | c[*n].SetLabels(lab); | |
1599 | //Split suspiciously big cluster | |
0e986ef9 | 1600 | if (nd>4 && nd<25) { |
1601 | c[*n].SetY(y/q-0.25*nd); | |
7f4044f0 | 1602 | c[*n].SetQ(0.5*q); |
1603 | (*n)++; | |
42283fd4 | 1604 | if (*n==mMAX) { |
c630aafd | 1605 | Error("FindClustersSSD","Too many 1D clusters !"); |
7f4044f0 | 1606 | return; |
1607 | } | |
0e986ef9 | 1608 | c[*n].SetY(y/q+0.25*nd); |
7f4044f0 | 1609 | c[*n].SetQ(0.5*q); |
1610 | c[*n].SetNd(nd); | |
1611 | c[*n].SetLabels(lab); | |
1612 | } | |
1613 | (*n)++; | |
42283fd4 | 1614 | if (*n==mMAX) { |
c630aafd | 1615 | Error("FindClustersSSD","Too many 1D clusters !"); |
7f4044f0 | 1616 | return; |
1617 | } | |
1618 | ||
c391f9d9 | 1619 | FindClustersSSD(neg, nn, pos, np, clusters); |
1620 | } | |
7f4044f0 | 1621 | |
c391f9d9 | 1622 | void AliITSclustererV2::FindClustersSSD(AliITSRawStream* input, |
1623 | TClonesArray** clusters) | |
1624 | { | |
1625 | //------------------------------------------------------------ | |
1626 | // Actual SSD cluster finder for raw data | |
1627 | //------------------------------------------------------------ | |
1628 | Int_t nClustersSSD = 0; | |
42283fd4 | 1629 | const Int_t mMAX = 1000; |
1630 | Ali1Dcluster clusters1D[2][mMAX]; | |
c391f9d9 | 1631 | Int_t nClusters[2] = {0, 0}; |
0e986ef9 | 1632 | Int_t lab[3]={-2,-2,-2}; |
c391f9d9 | 1633 | Float_t q = 0.; |
1634 | Float_t y = 0.; | |
1635 | Int_t nDigits = 0; | |
1636 | Int_t prevStrip = -1; | |
1637 | Int_t prevFlag = -1; | |
0e986ef9 | 1638 | Int_t prevModule = -1; |
c391f9d9 | 1639 | |
1640 | // read raw data input stream | |
1641 | while (kTRUE) { | |
1642 | Bool_t next = input->Next(); | |
1643 | ||
0e986ef9 | 1644 | if(input->GetSignal()<3 && next) continue; |
c391f9d9 | 1645 | // check if a new cluster starts |
1646 | Int_t strip = input->GetCoord2(); | |
1647 | Int_t flag = input->GetCoord1(); | |
0e986ef9 | 1648 | if ((!next || (input->GetModuleID() != prevModule)|| |
c391f9d9 | 1649 | (strip-prevStrip > 1) || (flag != prevFlag)) && |
1650 | (nDigits > 0)) { | |
42283fd4 | 1651 | if (nClusters[prevFlag] == mMAX) { |
c391f9d9 | 1652 | Error("FindClustersSSD", "Too many 1D clusters !"); |
1653 | return; | |
1654 | } | |
1655 | Ali1Dcluster& cluster = clusters1D[prevFlag][nClusters[prevFlag]++]; | |
1656 | cluster.SetY(y/q); | |
1657 | cluster.SetQ(q); | |
1658 | cluster.SetNd(nDigits); | |
0e986ef9 | 1659 | cluster.SetLabels(lab); |
c391f9d9 | 1660 | |
1661 | //Split suspiciously big cluster | |
0e986ef9 | 1662 | if (nDigits > 4&&nDigits < 25) { |
1663 | cluster.SetY(y/q - 0.25*nDigits); | |
c391f9d9 | 1664 | cluster.SetQ(0.5*q); |
42283fd4 | 1665 | if (nClusters[prevFlag] == mMAX) { |
c391f9d9 | 1666 | Error("FindClustersSSD", "Too many 1D clusters !"); |
1667 | return; | |
1668 | } | |
1669 | Ali1Dcluster& cluster2 = clusters1D[prevFlag][nClusters[prevFlag]++]; | |
0e986ef9 | 1670 | cluster2.SetY(y/q + 0.25*nDigits); |
c391f9d9 | 1671 | cluster2.SetQ(0.5*q); |
1672 | cluster2.SetNd(nDigits); | |
0e986ef9 | 1673 | cluster2.SetLabels(lab); |
7f4044f0 | 1674 | } |
c391f9d9 | 1675 | y = q = 0.; |
1676 | nDigits = 0; | |
7f4044f0 | 1677 | } |
c391f9d9 | 1678 | |
0e986ef9 | 1679 | if (!next || (input->GetModuleID() != prevModule)) { |
1680 | Int_t iModule = prevModule; | |
c391f9d9 | 1681 | |
1682 | // when all data from a module was read, search for clusters | |
1683 | if (prevFlag >= 0) { | |
1684 | clusters[iModule] = new TClonesArray("AliITSclusterV2"); | |
1685 | fI = iModule; | |
1686 | FindClustersSSD(&clusters1D[0][0], nClusters[0], | |
1687 | &clusters1D[1][0], nClusters[1], clusters[iModule]); | |
e8f4b841 | 1688 | Int_t noClusters = clusters[iModule]->GetEntriesFast(); |
1689 | nClustersSSD += noClusters; | |
c391f9d9 | 1690 | } |
1691 | ||
1692 | if (!next) break; | |
1693 | nClusters[0] = nClusters[1] = 0; | |
1694 | y = q = 0.; | |
1695 | nDigits = 0; | |
7f4044f0 | 1696 | } |
c391f9d9 | 1697 | |
1698 | // add digit to current cluster | |
1699 | q += input->GetSignal(); | |
1700 | y += strip * input->GetSignal(); | |
1701 | nDigits++; | |
1702 | prevStrip = strip; | |
1703 | prevFlag = flag; | |
0e986ef9 | 1704 | prevModule = input->GetModuleID(); |
1705 | ||
7f4044f0 | 1706 | } |
c391f9d9 | 1707 | |
1708 | Info("FindClustersSSD", "found clusters in ITS SSD: %d", nClustersSSD); | |
7f4044f0 | 1709 | } |
1710 |