]>
Commit | Line | Data |
---|---|---|
4c039060 | 1 | /************************************************************************** |
2 | * Copyright(c) 1998-1999, ALICE Experiment at CERN, All rights reserved. * | |
3 | * * | |
4 | * Author: The ALICE Off-line Project. * | |
5 | * Contributors are mentioned in the code where appropriate. * | |
6 | * * | |
7 | * Permission to use, copy, modify and distribute this software and its * | |
8 | * documentation strictly for non-commercial purposes is hereby granted * | |
9 | * without fee, provided that the above copyright notice appears in all * | |
10 | * copies and that both the copyright notice and this permission notice * | |
11 | * appear in the supporting documentation. The authors make no claims * | |
12 | * about the suitability of this software for any purpose. It is * | |
13 | * provided "as is" without express or implied warranty. * | |
14 | **************************************************************************/ | |
15 | ||
acd84897 | 16 | /* $Id$ */ |
4c039060 | 17 | |
fe4da5cc | 18 | /////////////////////////////////////////////////////////////////////////////// |
19 | // // | |
20 | // Base class for ALICE modules. Both sensitive modules (detectors) and // | |
21 | // non-sensitive ones are described by this base class. This class // | |
22 | // supports the hit and digit trees produced by the simulation and also // | |
23 | // the objects produced by the reconstruction. // | |
24 | // // | |
25 | // This class is also responsible for building the geometry of the // | |
26 | // detectors. // | |
27 | // // | |
28 | //Begin_Html | |
29 | /* | |
1439f98e | 30 | <img src="picts/AliDetectorClass.gif"> |
fe4da5cc | 31 | */ |
32 | //End_Html | |
33 | // // | |
34 | /////////////////////////////////////////////////////////////////////////////// | |
65fb704d | 35 | |
2ab0c725 | 36 | #include <TBrowser.h> |
6644b9ca | 37 | #include <TTree.h> |
fe4da5cc | 38 | |
594d8990 | 39 | #include "AliLog.h" |
9e1a0ddb | 40 | #include "AliConfig.h" |
94de3818 | 41 | #include "AliDetector.h" |
94de3818 | 42 | #include "AliHit.h" |
43 | #include "AliPoints.h" | |
88cb7938 | 44 | #include "AliLoader.h" |
6644b9ca | 45 | #include "AliRun.h" |
5d12ce38 | 46 | #include "AliMC.h" |
aab9c8d5 | 47 | |
9e1a0ddb | 48 | |
fe4da5cc | 49 | ClassImp(AliDetector) |
50 | ||
6644b9ca | 51 | //_______________________________________________________________________ |
52 | AliDetector::AliDetector(): | |
75c4b017 | 53 | AliModule(), |
6644b9ca | 54 | fTimeGate(200.e-9), |
55 | fIshunt(0), | |
56 | fNhits(0), | |
57 | fNdigits(0), | |
58 | fBufferSize(1600), | |
90e48c0c | 59 | fMaxIterHit(0), |
60 | fCurIterHit(0), | |
6644b9ca | 61 | fHits(0), |
62 | fDigits(0), | |
88cb7938 | 63 | fPoints(0), |
64 | fLoader(0x0) | |
fe4da5cc | 65 | { |
66 | // | |
67 | // Default constructor for the AliDetector class | |
68 | // | |
fe4da5cc | 69 | } |
70 | ||
e2afb3b6 | 71 | //_______________________________________________________________________ |
72 | AliDetector::AliDetector(const AliDetector &det): | |
73 | AliModule(det), | |
74 | fTimeGate(200.e-9), | |
75 | fIshunt(0), | |
76 | fNhits(0), | |
77 | fNdigits(0), | |
78 | fBufferSize(1600), | |
90e48c0c | 79 | fMaxIterHit(0), |
80 | fCurIterHit(0), | |
e2afb3b6 | 81 | fHits(0), |
82 | fDigits(0), | |
88cb7938 | 83 | fPoints(0), |
84 | fLoader(0x0) | |
e2afb3b6 | 85 | { |
86 | det.Copy(*this); | |
87 | } | |
88 | ||
fe4da5cc | 89 | //_____________________________________________________________________________ |
6644b9ca | 90 | AliDetector::AliDetector(const char* name,const char *title): |
91 | AliModule(name,title), | |
92 | fTimeGate(200.e-9), | |
93 | fIshunt(0), | |
94 | fNhits(0), | |
95 | fNdigits(0), | |
96 | fBufferSize(1600), | |
90e48c0c | 97 | fMaxIterHit(0), |
98 | fCurIterHit(0), | |
6644b9ca | 99 | fHits(0), |
100 | fDigits(0), | |
88cb7938 | 101 | fPoints(0), |
102 | fLoader(0x0) | |
fe4da5cc | 103 | { |
104 | // | |
105 | // Normal constructor invoked by all Detectors. | |
106 | // Create the list for detector specific histograms | |
107 | // Add this Detector to the global list of Detectors in Run. | |
108 | // | |
109 | ||
fe4da5cc | 110 | fActive = kTRUE; |
9e1a0ddb | 111 | AliConfig::Instance()->Add(this); |
aab9c8d5 | 112 | |
fe4da5cc | 113 | } |
114 | ||
6644b9ca | 115 | //_______________________________________________________________________ |
fe4da5cc | 116 | AliDetector::~AliDetector() |
117 | { | |
118 | // | |
119 | // Destructor | |
120 | // | |
6644b9ca | 121 | |
fe4da5cc | 122 | // Delete space point structure |
e460afec | 123 | if (fPoints) { |
124 | fPoints->Delete(); | |
125 | delete fPoints; | |
126 | fPoints = 0; | |
127 | } | |
128 | // Delete digits structure | |
129 | if (fDigits) { | |
130 | fDigits->Delete(); | |
131 | delete fDigits; | |
132 | fDigits = 0; | |
133 | } | |
88cb7938 | 134 | |
135 | if (fLoader) | |
136 | { | |
137 | fLoader->GetModulesFolder()->Remove(this); | |
138 | } | |
139 | ||
fe4da5cc | 140 | } |
9e1a0ddb | 141 | |
6644b9ca | 142 | //_______________________________________________________________________ |
3a83c716 | 143 | void AliDetector::Publish(const char */*dir*/, void */*address*/, const char */*name*/) const |
9e1a0ddb | 144 | { |
88cb7938 | 145 | // |
146 | // Register pointer to detector objects. | |
147 | // | |
88cb7938 | 148 | MayNotUse("Publish"); |
9e1a0ddb | 149 | } |
150 | ||
4787b401 | 151 | //_______________________________________________________________________ |
152 | void AliDetector::AddAlignableVolumes() const | |
153 | { | |
154 | // | |
155 | AliWarning(Form("%s still has to implement the AddAlignableVolumes method!",GetName())); | |
156 | } | |
157 | ||
6644b9ca | 158 | //_______________________________________________________________________ |
159 | TBranch* AliDetector::MakeBranchInTree(TTree *tree, const char* name, | |
160 | void* address, Int_t size, | |
161 | const char *file) | |
9e1a0ddb | 162 | { |
d0f40f23 | 163 | return(MakeBranchInTree(tree,name,0,address,size,99,file)); |
9e1a0ddb | 164 | } |
165 | ||
6644b9ca | 166 | //_______________________________________________________________________ |
167 | TBranch* AliDetector::MakeBranchInTree(TTree *tree, const char* name, | |
168 | const char *classname, | |
169 | void* address,Int_t size, | |
d1898505 | 170 | Int_t splitlevel, const char */*file*/) |
9e1a0ddb | 171 | { |
88cb7938 | 172 | // |
173 | // Makes branch in given tree and diverts them to a separate file | |
174 | // | |
175 | // | |
176 | // | |
a96ab15b | 177 | |
594d8990 | 178 | AliDebug(2,Form("Making Branch %s",name)); |
88cb7938 | 179 | if (tree == 0x0) |
180 | { | |
594d8990 | 181 | AliError(Form("Making Branch %s Tree is NULL",name)); |
88cb7938 | 182 | return 0x0; |
183 | } | |
184 | TBranch *branch = tree->GetBranch(name); | |
185 | if (branch) | |
186 | { | |
594d8990 | 187 | AliDebug(2,Form("Branch %s is already in tree.",name)); |
9e1a0ddb | 188 | return branch; |
88cb7938 | 189 | } |
190 | ||
191 | if (classname) | |
192 | { | |
193 | branch = tree->Branch(name,classname,address,size,splitlevel); | |
194 | } | |
195 | else | |
196 | { | |
a96ab15b | 197 | branch = tree->Bronch(name, "TClonesArray", address, size, splitlevel); |
88cb7938 | 198 | } |
594d8990 | 199 | AliDebug(2,Form("Branch %s returning branch %#x",name,branch)); |
88cb7938 | 200 | return branch; |
9e1a0ddb | 201 | } |
202 | ||
6644b9ca | 203 | //_______________________________________________________________________ |
fe4da5cc | 204 | void AliDetector::Browse(TBrowser *b) |
205 | { | |
206 | // | |
207 | // Insert Detector objects in the list of objects to be browsed | |
208 | // | |
209 | char name[64]; | |
210 | if( fHits == 0) return; | |
211 | TObject *obj; | |
212 | Int_t i, nobjects; | |
213 | // | |
214 | nobjects = fHits->GetEntries(); | |
215 | for (i=0;i<nobjects;i++) { | |
216 | obj = fHits->At(i); | |
217 | sprintf(name,"%s_%d",obj->GetName(),i); | |
218 | b->Add(obj, &name[0]); | |
219 | } | |
220 | } | |
221 | ||
6644b9ca | 222 | //_______________________________________________________________________ |
6c4904c2 | 223 | void AliDetector::Copy(TObject &) const |
8918e700 | 224 | { |
225 | // | |
226 | // Copy *this onto det -- not implemented | |
227 | // | |
594d8990 | 228 | AliFatal("Not implemented"); |
8918e700 | 229 | } |
230 | ||
6644b9ca | 231 | //_______________________________________________________________________ |
fe4da5cc | 232 | void AliDetector::FinishRun() |
233 | { | |
234 | // | |
235 | // Procedure called at the end of a run. | |
236 | // | |
237 | } | |
238 | ||
6644b9ca | 239 | //_______________________________________________________________________ |
fe4da5cc | 240 | AliHit* AliDetector::FirstHit(Int_t track) |
241 | { | |
242 | // | |
243 | // Initialise the hit iterator | |
244 | // Return the address of the first hit for track | |
245 | // If track>=0 the track is read from disk | |
246 | // while if track<0 the first hit of the current | |
247 | // track is returned | |
248 | // | |
249 | if(track>=0) { | |
88cb7938 | 250 | gAlice->ResetHits(); //stupid = if N detector this method is called N times |
251 | TreeH()->GetEvent(track); //skowron | |
fe4da5cc | 252 | } |
253 | // | |
3a83c716 | 254 | fMaxIterHit=fHits->GetEntriesFast(); |
255 | fCurIterHit=0; | |
256 | if(fMaxIterHit) return dynamic_cast<AliHit*>(fHits->UncheckedAt(0)); | |
fe4da5cc | 257 | else return 0; |
258 | } | |
259 | ||
6644b9ca | 260 | //_______________________________________________________________________ |
fe4da5cc | 261 | AliHit* AliDetector::NextHit() |
262 | { | |
263 | // | |
264 | // Return the next hit for the current track | |
265 | // | |
3a83c716 | 266 | if(fMaxIterHit) { |
267 | if(++fCurIterHit<fMaxIterHit) | |
268 | return dynamic_cast<AliHit*>(fHits->UncheckedAt(fCurIterHit)); | |
fe4da5cc | 269 | else |
270 | return 0; | |
271 | } else { | |
594d8990 | 272 | AliWarning("Hit Iterator called without calling FistHit before"); |
fe4da5cc | 273 | return 0; |
274 | } | |
275 | } | |
6644b9ca | 276 | |
6644b9ca | 277 | //_______________________________________________________________________ |
fe4da5cc | 278 | void AliDetector::LoadPoints(Int_t) |
279 | { | |
280 | // | |
281 | // Store x, y, z of all hits in memory | |
282 | // | |
88cb7938 | 283 | if (fHits == 0) |
284 | { | |
594d8990 | 285 | AliError(Form("fHits == 0. Name is %s",GetName())); |
88cb7938 | 286 | return; |
287 | } | |
fe4da5cc | 288 | // |
fe4da5cc | 289 | Int_t nhits = fHits->GetEntriesFast(); |
88cb7938 | 290 | if (nhits == 0) |
291 | { | |
292 | // Error("LoadPoints","nhits == 0. Name is %s",GetName()); | |
293 | return; | |
294 | } | |
5d12ce38 | 295 | Int_t tracks = gAlice->GetMCApp()->GetNtrack(); |
080a67a1 | 296 | if (fPoints == 0) fPoints = new TObjArray(tracks); |
fe4da5cc | 297 | AliHit *ahit; |
298 | // | |
080a67a1 | 299 | Int_t *ntrk=new Int_t[tracks]; |
300 | Int_t *limi=new Int_t[tracks]; | |
301 | Float_t **coor=new Float_t*[tracks]; | |
302 | for(Int_t i=0;i<tracks;i++) { | |
303 | ntrk[i]=0; | |
304 | coor[i]=0; | |
305 | limi[i]=0; | |
306 | } | |
307 | // | |
fe4da5cc | 308 | AliPoints *points = 0; |
080a67a1 | 309 | Float_t *fp=0; |
310 | Int_t trk; | |
311 | Int_t chunk=nhits/4+1; | |
fe4da5cc | 312 | // |
313 | // Loop over all the hits and store their position | |
314 | for (Int_t hit=0;hit<nhits;hit++) { | |
e2afb3b6 | 315 | ahit = dynamic_cast<AliHit*>(fHits->UncheckedAt(hit)); |
080a67a1 | 316 | trk=ahit->GetTrack(); |
f08c15f7 | 317 | if(trk>tracks) { |
318 | AliError(Form("Found track number %d, max track %d",trk, tracks)); | |
319 | continue; | |
320 | } | |
88cb7938 | 321 | if(ntrk[trk]==limi[trk]) |
322 | { | |
fe4da5cc | 323 | // |
324 | // Initialise a new track | |
080a67a1 | 325 | fp=new Float_t[3*(limi[trk]+chunk)]; |
88cb7938 | 326 | if(coor[trk]) |
327 | { | |
328 | memcpy(fp,coor[trk],sizeof(Float_t)*3*limi[trk]); | |
329 | delete [] coor[trk]; | |
330 | } | |
080a67a1 | 331 | limi[trk]+=chunk; |
332 | coor[trk] = fp; | |
88cb7938 | 333 | } |
334 | else | |
335 | { | |
080a67a1 | 336 | fp = coor[trk]; |
88cb7938 | 337 | } |
94de3818 | 338 | fp[3*ntrk[trk] ] = ahit->X(); |
339 | fp[3*ntrk[trk]+1] = ahit->Y(); | |
340 | fp[3*ntrk[trk]+2] = ahit->Z(); | |
080a67a1 | 341 | ntrk[trk]++; |
342 | } | |
343 | // | |
344 | for(trk=0; trk<tracks; ++trk) { | |
345 | if(ntrk[trk]) { | |
346 | points = new AliPoints(); | |
fe4da5cc | 347 | points->SetMarkerColor(GetMarkerColor()); |
fe4da5cc | 348 | points->SetMarkerSize(GetMarkerSize()); |
349 | points->SetDetector(this); | |
350 | points->SetParticle(trk); | |
080a67a1 | 351 | points->SetPolyMarker(ntrk[trk],coor[trk],GetMarkerStyle()); |
352 | fPoints->AddAt(points,trk); | |
353 | delete [] coor[trk]; | |
354 | coor[trk]=0; | |
fe4da5cc | 355 | } |
fe4da5cc | 356 | } |
080a67a1 | 357 | delete [] coor; |
358 | delete [] ntrk; | |
359 | delete [] limi; | |
fe4da5cc | 360 | } |
361 | ||
6644b9ca | 362 | //_______________________________________________________________________ |
88cb7938 | 363 | void AliDetector::MakeBranch(Option_t *option) |
fe4da5cc | 364 | { |
365 | // | |
88cb7938 | 366 | // Create a new branch for this detector in its treeH |
fe4da5cc | 367 | // |
88cb7938 | 368 | |
594d8990 | 369 | AliDebug(2,Form(" for %s",GetName())); |
5cf7bbad | 370 | const char *cH = strstr(option,"H"); |
2ab0c725 | 371 | |
88cb7938 | 372 | if (fHits && TreeH() && cH) |
373 | { | |
374 | MakeBranchInTree(TreeH(), GetName(), &fHits, fBufferSize, 0); | |
375 | } | |
aab9c8d5 | 376 | } |
fe4da5cc | 377 | |
6644b9ca | 378 | //_______________________________________________________________________ |
fe4da5cc | 379 | void AliDetector::ResetDigits() |
380 | { | |
381 | // | |
382 | // Reset number of digits and the digits array | |
383 | // | |
384 | fNdigits = 0; | |
88cb7938 | 385 | if (fDigits) fDigits->Clear(); |
fe4da5cc | 386 | } |
387 | ||
6644b9ca | 388 | //_______________________________________________________________________ |
fe4da5cc | 389 | void AliDetector::ResetHits() |
390 | { | |
391 | // | |
392 | // Reset number of hits and the hits array | |
393 | // | |
394 | fNhits = 0; | |
88cb7938 | 395 | if (fHits) fHits->Clear(); |
fe4da5cc | 396 | } |
397 | ||
6644b9ca | 398 | //_______________________________________________________________________ |
fe4da5cc | 399 | void AliDetector::ResetPoints() |
400 | { | |
401 | // | |
402 | // Reset array of points | |
403 | // | |
404 | if (fPoints) { | |
405 | fPoints->Delete(); | |
406 | delete fPoints; | |
407 | fPoints = 0; | |
408 | } | |
409 | } | |
410 | ||
6644b9ca | 411 | //_______________________________________________________________________ |
fe4da5cc | 412 | void AliDetector::SetTreeAddress() |
413 | { | |
414 | // | |
415 | // Set branch address for the Hits and Digits Trees | |
416 | // | |
417 | TBranch *branch; | |
fe4da5cc | 418 | // |
419 | // Branch address for hit tree | |
88cb7938 | 420 | |
421 | TTree *tree = TreeH(); | |
422 | if (tree && fHits) { | |
423 | branch = tree->GetBranch(GetName()); | |
424 | if (branch) | |
425 | { | |
594d8990 | 426 | AliDebug(2,Form("(%s) Setting for Hits",GetName())); |
88cb7938 | 427 | branch->SetAddress(&fHits); |
428 | } | |
429 | else | |
f2a509af | 430 | { //can be invoked before branch creation |
594d8990 | 431 | AliDebug(2,Form("(%s) Failed for Hits. Can not find branch in tree.",GetName())); |
88cb7938 | 432 | } |
fe4da5cc | 433 | } |
88cb7938 | 434 | |
fe4da5cc | 435 | // |
436 | // Branch address for digit tree | |
88cb7938 | 437 | TTree *treeD = fLoader->TreeD(); |
fe4da5cc | 438 | if (treeD && fDigits) { |
88cb7938 | 439 | branch = treeD->GetBranch(GetName()); |
fe4da5cc | 440 | if (branch) branch->SetAddress(&fDigits); |
441 | } | |
2cad796f | 442 | |
443 | AliModule::SetTreeAddress(); | |
fe4da5cc | 444 | } |
445 | ||
88cb7938 | 446 | //_______________________________________________________________________ |
447 | void AliDetector::MakeTree(Option_t *option) | |
448 | { | |
449 | //makes a tree (container) for the data defined in option | |
450 | //"H" - hits | |
451 | //"D" - digits | |
452 | //"S" - summable digits | |
453 | //"R" - recontructed points and tracks | |
fe4da5cc | 454 | |
88cb7938 | 455 | AliLoader* loader = GetLoader(); |
456 | if (loader == 0x0) | |
457 | { | |
594d8990 | 458 | AliError(Form("Can not get loader for %s",GetName())); |
88cb7938 | 459 | return; |
460 | } | |
461 | loader->MakeTree(option); //delegate this job to getter | |
462 | } | |
463 | ||
464 | //_______________________________________________________________________ | |
465 | AliLoader* AliDetector::MakeLoader(const char* topfoldername) | |
466 | { | |
467 | //builds standard getter (AliLoader type) | |
468 | //if detector wants to use castomized getter, it must overload this method | |
469 | ||
594d8990 | 470 | AliDebug(1,Form("Creating standard getter for detector %s. Top folder is %s.", |
471 | GetName(),topfoldername)); | |
88cb7938 | 472 | |
473 | fLoader = new AliLoader(GetName(),topfoldername); | |
474 | return fLoader; | |
88cb7938 | 475 | } |
476 | ||
477 | //_______________________________________________________________________ | |
3a83c716 | 478 | TTree* AliDetector::TreeH() const |
88cb7938 | 479 | { |
480 | //Get the hits container from the folder | |
481 | if (GetLoader() == 0x0) | |
482 | { | |
483 | //sunstitude this with make getter when we can obtain the event folder name | |
594d8990 | 484 | AliError("Can not get the getter"); |
88cb7938 | 485 | return 0x0; |
486 | } | |
487 | ||
488 | TTree* tree = (TTree*)GetLoader()->TreeH(); | |
489 | return tree; | |
490 | } | |
491 |