| 1 | /* ======================================================================== *\ | 
|---|
| 2 | ! | 
|---|
| 3 | ! * | 
|---|
| 4 | ! * This file is part of MARS, the MAGIC Analysis and Reconstruction | 
|---|
| 5 | ! * Software. It is distributed to you in the hope that it can be a useful | 
|---|
| 6 | ! * and timesaving tool in analysing Data of imaging Cerenkov telescopes. | 
|---|
| 7 | ! * It is distributed WITHOUT ANY WARRANTY. | 
|---|
| 8 | ! * | 
|---|
| 9 | ! * Permission to use, copy, modify and distribute this software and its | 
|---|
| 10 | ! * documentation for any purpose is hereby granted without fee, | 
|---|
| 11 | ! * provided that the above copyright notice appear in all copies and | 
|---|
| 12 | ! * that both that copyright notice and this permission notice appear | 
|---|
| 13 | ! * in supporting documentation. It is provided "as is" without express | 
|---|
| 14 | ! * or implied warranty. | 
|---|
| 15 | ! * | 
|---|
| 16 | ! | 
|---|
| 17 | ! | 
|---|
| 18 | !   Author(s): Josep Flix 04/2001 <mailto:jflix@ifae.es> | 
|---|
| 19 | !   Author(s): Thomas Bretz 05/2001 <mailto:tbretz@astro.uni-wuerzburg.de> | 
|---|
| 20 | !   Author(s): Sebastian Commichau 12/2003 | 
|---|
| 21 | !   Author(s): Javier Rico 01/2004 <mailto:jrico@ifae.es> | 
|---|
| 22 | !   Author(s): Markus Gaug 01/2004 <mailto:markus@ifae.es> | 
|---|
| 23 | ! | 
|---|
| 24 | !   Copyright: MAGIC Software Development, 2000-2004 | 
|---|
| 25 | ! | 
|---|
| 26 | ! | 
|---|
| 27 | \* ======================================================================== */ | 
|---|
| 28 | ///////////////////////////////////////////////////////////////////////////// | 
|---|
| 29 | // | 
|---|
| 30 | //   MPedCalcPedRun | 
|---|
| 31 | // | 
|---|
| 32 | //  This task takes a pedestal run file and fills MPedestalCam during | 
|---|
| 33 | //  the Process() with the pedestal and rms computed in an event basis. | 
|---|
| 34 | //  In the PostProcess() MPedestalCam is finally filled with the pedestal | 
|---|
| 35 | //  mean and rms computed in a run basis. | 
|---|
| 36 | //  More than one run (file) can be merged | 
|---|
| 37 | // | 
|---|
| 38 | //  MPedCalcPedRun applies the following formula (1): | 
|---|
| 39 | // | 
|---|
| 40 | //  Pedestal per slice = sum(x_i) / n / slices | 
|---|
| 41 | //  PedRMS per slice   = Sqrt(  ( sum(x_i^2) - sum(x_i)^2/n ) / n-1 / slices ) | 
|---|
| 42 | // | 
|---|
| 43 | //  where x_i is the sum of "slices" FADC slices and sum means the sum over all | 
|---|
| 44 | //  events. "n" is the number of events, "slices" is the number of summed FADC samples. | 
|---|
| 45 | // | 
|---|
| 46 | //  Note that the slice-to-slice fluctuations are not Gaussian, but Poissonian, thus | 
|---|
| 47 | //  asymmetric and they are correlated. | 
|---|
| 48 | // | 
|---|
| 49 | //  It is important to know that the Pedestal per slice and PedRMS per slice depend | 
|---|
| 50 | //  on the number of used FADC slices, as seen in the following plots: | 
|---|
| 51 | // | 
|---|
| 52 | //Begin_Html | 
|---|
| 53 | /* | 
|---|
| 54 | <img src="images/PedestalStudyInner.gif"> | 
|---|
| 55 | */ | 
|---|
| 56 | //End_Html | 
|---|
| 57 | // | 
|---|
| 58 | //Begin_Html | 
|---|
| 59 | /* | 
|---|
| 60 | <img src="images/PedestalStudyOuter.gif"> | 
|---|
| 61 | */ | 
|---|
| 62 | // | 
|---|
| 63 | // The plots show the inner and outer pixels, respectivly and have the following meaning: | 
|---|
| 64 | // | 
|---|
| 65 | // 1) The calculated mean pedestal per slice (from MPedCalcPedRun) | 
|---|
| 66 | // 2) The fitted mean pedestal per slice     (from MHPedestalCam) | 
|---|
| 67 | // 3) The calculated pedestal RMS per slice  (from MPedCalcPedRun) | 
|---|
| 68 | // 4) The fitted sigma of the pedestal distribution per slice | 
|---|
| 69 | //                                           (from MHPedestalCam) | 
|---|
| 70 | // 5) The relative difference between calculation and histogram fit | 
|---|
| 71 | //    for the mean | 
|---|
| 72 | // 6) The relative difference between calculation and histogram fit | 
|---|
| 73 | //    for the sigma or RMS, respectively. | 
|---|
| 74 | // | 
|---|
| 75 | // The calculated means do not change significantly except for the case of 2 slices, | 
|---|
| 76 | // however the RMS changes from 5.7 per slice in the case of 2 extracted slices | 
|---|
| 77 | // to 8.3 per slice in the case of 26 extracted slices. This change is very significant. | 
|---|
| 78 | // | 
|---|
| 79 | // The plots have been produced on run 20123. You can reproduce them using | 
|---|
| 80 | // the macro pedestalstudies.C | 
|---|
| 81 | // | 
|---|
| 82 | //  Usage of this class: | 
|---|
| 83 | //  ==================== | 
|---|
| 84 | // | 
|---|
| 85 | //  Call: SetRange(higainfirst, higainlast, logainfirst, logainlast) | 
|---|
| 86 | //  to modify the ranges in which the window is allowed to move. | 
|---|
| 87 | //  Defaults are: | 
|---|
| 88 | // | 
|---|
| 89 | //   fHiGainFirst =  fgHiGainFirst =  0 | 
|---|
| 90 | //   fHiGainLast  =  fgHiGainLast  =  29 | 
|---|
| 91 | //   fLoGainFirst =  fgLoGainFirst =  0 | 
|---|
| 92 | //   fLoGainLast  =  fgLoGainLast  =  14 | 
|---|
| 93 | // | 
|---|
| 94 | //  Call: SetWindowSize(windowhigain, windowlogain) | 
|---|
| 95 | //  to modify the sliding window widths. Windows have to be an even number. | 
|---|
| 96 | //  In case of odd numbers, the window will be modified. | 
|---|
| 97 | // | 
|---|
| 98 | //  Defaults are: | 
|---|
| 99 | // | 
|---|
| 100 | //   fHiGainWindowSize = fgHiGainWindowSize = 14 | 
|---|
| 101 | //   fLoGainWindowSize = fgLoGainWindowSize = 0 | 
|---|
| 102 | // | 
|---|
| 103 | // | 
|---|
| 104 | // ToDo: | 
|---|
| 105 | //   - Take a setup file (ReadEnv-implementation) as input | 
|---|
| 106 | // | 
|---|
| 107 | // | 
|---|
| 108 | //  Input Containers: | 
|---|
| 109 | //   MRawEvtData | 
|---|
| 110 | //   MRawRunHeader | 
|---|
| 111 | //   MRawEvtHeader | 
|---|
| 112 | //   MGeomCam | 
|---|
| 113 | // | 
|---|
| 114 | //  Output Containers: | 
|---|
| 115 | //   MPedestalCam | 
|---|
| 116 | // | 
|---|
| 117 | //  See also: MPedestalCam, MPedestalPix, MHPedestalCam, MExtractor | 
|---|
| 118 | // | 
|---|
| 119 | ///////////////////////////////////////////////////////////////////////////// | 
|---|
| 120 | #include "MPedCalcPedRun.h" | 
|---|
| 121 |  | 
|---|
| 122 | #include "MParList.h" | 
|---|
| 123 |  | 
|---|
| 124 | #include "MLog.h" | 
|---|
| 125 | #include "MLogManip.h" | 
|---|
| 126 |  | 
|---|
| 127 | #include "MRawRunHeader.h" | 
|---|
| 128 | #include "MRawEvtHeader.h" | 
|---|
| 129 | #include "MRawEvtPixelIter.h" | 
|---|
| 130 | #include "MRawEvtData.h" | 
|---|
| 131 |  | 
|---|
| 132 | #include "MPedestalPix.h" | 
|---|
| 133 | #include "MPedestalCam.h" | 
|---|
| 134 |  | 
|---|
| 135 | #include "MGeomPix.h" | 
|---|
| 136 | #include "MGeomCam.h" | 
|---|
| 137 |  | 
|---|
| 138 | #include "MExtractPedestal.h" | 
|---|
| 139 | #include "MExtractTimeAndCharge.h" | 
|---|
| 140 |  | 
|---|
| 141 | #include "MTriggerPattern.h" | 
|---|
| 142 |  | 
|---|
| 143 | ClassImp(MPedCalcPedRun); | 
|---|
| 144 |  | 
|---|
| 145 | using namespace std; | 
|---|
| 146 |  | 
|---|
| 147 | const UShort_t MPedCalcPedRun::fgExtractWinFirst       = 0; | 
|---|
| 148 | const UShort_t MPedCalcPedRun::fgExtractWinSize        = 6; | 
|---|
| 149 | const UInt_t   MPedCalcPedRun::gkFirstRunWithFinalBits = 45605; | 
|---|
| 150 | // -------------------------------------------------------------------------- | 
|---|
| 151 | // | 
|---|
| 152 | // Default constructor: | 
|---|
| 153 | // | 
|---|
| 154 | // Sets: | 
|---|
| 155 | // - all pointers to NULL | 
|---|
| 156 | // - fWindowSizeHiGain to fgHiGainWindowSize | 
|---|
| 157 | // - fWindowSizeLoGain to fgLoGainWindowSize | 
|---|
| 158 | // | 
|---|
| 159 | // Calls: | 
|---|
| 160 | // - AddToBranchList("fHiGainPixId"); | 
|---|
| 161 | // - AddToBranchList("fHiGainFadcSamples"); | 
|---|
| 162 | // - SetRange(fgHiGainFirst, fgHiGainLast, fgLoGainFirst, fgLoGainLast) | 
|---|
| 163 | // | 
|---|
| 164 | MPedCalcPedRun::MPedCalcPedRun(const char *name, const char *title) | 
|---|
| 165 | : fOverlap(0), fIsFirstPedRun(kFALSE), fUsedEvents(0), fTrigPattern(NULL) | 
|---|
| 166 | { | 
|---|
| 167 | fName  = name  ? name  : "MPedCalcPedRun"; | 
|---|
| 168 | fTitle = title ? title : "Task to calculate pedestals from pedestal runs raw data"; | 
|---|
| 169 |  | 
|---|
| 170 | SetExtractWindow(fgExtractWinFirst, fgExtractWinSize); | 
|---|
| 171 |  | 
|---|
| 172 | //  SetNumEventsDump(1001); | 
|---|
| 173 | //  SetNumAreasDump(1001); | 
|---|
| 174 | //  SetNumSectorsDump(1001); | 
|---|
| 175 | } | 
|---|
| 176 |  | 
|---|
| 177 | // -------------------------------------------------------------------------- | 
|---|
| 178 | // | 
|---|
| 179 | // In case that the variables fExtractLast is greater than the number of | 
|---|
| 180 | // High-Gain FADC samples obtained from the run header, the flag | 
|---|
| 181 | // fOverlap is set to the difference and fExtractLast is set back by the | 
|---|
| 182 | // same number of slices. | 
|---|
| 183 | // | 
|---|
| 184 | void MPedCalcPedRun::CheckExtractionWindow() | 
|---|
| 185 | { | 
|---|
| 186 | const UShort_t lastavailable = fRunHeader->GetNumSamplesHiGain()-1; | 
|---|
| 187 |  | 
|---|
| 188 | if (fExtractWinLast <= lastavailable) | 
|---|
| 189 | return; | 
|---|
| 190 |  | 
|---|
| 191 | const UShort_t diff = fExtractWinLast - lastavailable; | 
|---|
| 192 |  | 
|---|
| 193 | *fLog << warn << endl; | 
|---|
| 194 | *fLog << "Selected ExtractWindow [" << fExtractWinFirst << "," << fExtractWinLast; | 
|---|
| 195 | *fLog << "] ranges out of range [0," << lastavailable << "]." << endl; | 
|---|
| 196 | *fLog << "Using " << diff << " samples from the 'Lo-Gain' slices for the pedestal extraction" << endl; | 
|---|
| 197 |  | 
|---|
| 198 | fExtractWinLast -= diff; | 
|---|
| 199 | fOverlap         = diff; | 
|---|
| 200 | } | 
|---|
| 201 |  | 
|---|
| 202 | void MPedCalcPedRun::Reset() | 
|---|
| 203 | { | 
|---|
| 204 |  | 
|---|
| 205 | MExtractPedestal::ResetArrays(); | 
|---|
| 206 | fUsedEvents    = 0; | 
|---|
| 207 | } | 
|---|
| 208 |  | 
|---|
| 209 | // -------------------------------------------------------------------------- | 
|---|
| 210 | // | 
|---|
| 211 | // Set fIsFirstPedRun=kTRUE | 
|---|
| 212 | // | 
|---|
| 213 | Int_t MPedCalcPedRun::PreProcess(MParList *pList) | 
|---|
| 214 | { | 
|---|
| 215 |  | 
|---|
| 216 | fUsedEvents    = 0; | 
|---|
| 217 | fIsFirstPedRun = kTRUE; | 
|---|
| 218 | fIsNotPedRun   = kFALSE; | 
|---|
| 219 |  | 
|---|
| 220 | fTrigPattern = (MTriggerPattern*)pList->FindObject("MTriggerPattern"); | 
|---|
| 221 | if (!fTrigPattern) | 
|---|
| 222 | *fLog << inf << "MTriggerPattern not found... Cannot use interlaced pedestal events." << endl; | 
|---|
| 223 |  | 
|---|
| 224 | return MExtractPedestal::PreProcess(pList); | 
|---|
| 225 | } | 
|---|
| 226 |  | 
|---|
| 227 | // -------------------------------------------------------------------------- | 
|---|
| 228 | // | 
|---|
| 229 | // The run type is checked for "kRTPedestal" | 
|---|
| 230 | // and the variable fIsNotPedRun is set in that case | 
|---|
| 231 | // | 
|---|
| 232 | Bool_t MPedCalcPedRun::ReInit(MParList *pList) | 
|---|
| 233 | { | 
|---|
| 234 |  | 
|---|
| 235 | if (!MExtractPedestal::ReInit(pList)) | 
|---|
| 236 | return kFALSE; | 
|---|
| 237 |  | 
|---|
| 238 | CheckExtractionWindow(); | 
|---|
| 239 |  | 
|---|
| 240 | // | 
|---|
| 241 | // If this is the first ped run, the next run (call to ReInit) | 
|---|
| 242 | // is not the first anymore | 
|---|
| 243 | // | 
|---|
| 244 | switch (fRunHeader->GetRunType()) | 
|---|
| 245 | { | 
|---|
| 246 | case MRawRunHeader::kRTPedestal: | 
|---|
| 247 | case MRawRunHeader::kRTMonteCarlo: | 
|---|
| 248 | fIsFirstPedRun = kFALSE; | 
|---|
| 249 | fIsNotPedRun   = kFALSE; | 
|---|
| 250 | return kTRUE; | 
|---|
| 251 |  | 
|---|
| 252 | case MRawRunHeader::kRTCalibration: | 
|---|
| 253 | { | 
|---|
| 254 | TString proj(fRunHeader->GetProjectName()); | 
|---|
| 255 | proj.ToLower(); | 
|---|
| 256 |  | 
|---|
| 257 | // test if a continuous light run has been declared as calibration... | 
|---|
| 258 | if (proj.Contains("cl")) | 
|---|
| 259 | { | 
|---|
| 260 | fIsFirstPedRun = kFALSE; | 
|---|
| 261 | fIsNotPedRun   = kFALSE; | 
|---|
| 262 | return kTRUE; | 
|---|
| 263 | } | 
|---|
| 264 | } | 
|---|
| 265 | } | 
|---|
| 266 |  | 
|---|
| 267 | fIsNotPedRun = kTRUE; | 
|---|
| 268 |  | 
|---|
| 269 | // | 
|---|
| 270 | // If this is the first call to ReInit (before reading the first file) | 
|---|
| 271 | // nothing should be done. It occurs for the case that the first treated | 
|---|
| 272 | // file is not of pedestal type. | 
|---|
| 273 | // | 
|---|
| 274 | if (fIsFirstPedRun) | 
|---|
| 275 | return kTRUE; | 
|---|
| 276 |  | 
|---|
| 277 | // | 
|---|
| 278 | // In the other case, produce the MPedestalCam to be use the subsequent | 
|---|
| 279 | // (non-pedestal) events | 
|---|
| 280 | // | 
|---|
| 281 | *fLog << inf << "Finalizing pedestal calculations..." << flush; | 
|---|
| 282 |  | 
|---|
| 283 | if (!Finalize()) | 
|---|
| 284 | return kFALSE; | 
|---|
| 285 |  | 
|---|
| 286 | Reset(); | 
|---|
| 287 |  | 
|---|
| 288 | return kTRUE; | 
|---|
| 289 | } | 
|---|
| 290 |  | 
|---|
| 291 | // -------------------------------------------------------------------------- | 
|---|
| 292 | // | 
|---|
| 293 | // Return kTRUE (without doing anything) in case that the run type is not | 
|---|
| 294 | // equal to 1 (pedestal run) | 
|---|
| 295 | // | 
|---|
| 296 | // Fill the MPedestalCam container with the signal mean and rms for the event. | 
|---|
| 297 | // Store the measured signal in arrays fSumx and fSumx2 so that we can | 
|---|
| 298 | // calculate the overall mean and rms in the PostProcess() | 
|---|
| 299 | // | 
|---|
| 300 | Int_t MPedCalcPedRun::Calc() | 
|---|
| 301 | { | 
|---|
| 302 | if (fIsNotPedRun && !IsPedBitSet()) | 
|---|
| 303 | return kTRUE; | 
|---|
| 304 |  | 
|---|
| 305 | //  if (fUsedEvents == fNumEventsDump) | 
|---|
| 306 | //    { | 
|---|
| 307 | //      *fLog << endl; | 
|---|
| 308 | //      *fLog << inf << GetDescriptor() << " : Finalize pedestal calculations..." << flush; | 
|---|
| 309 | //      Finalize(); | 
|---|
| 310 | //      Reset(); | 
|---|
| 311 | //    } | 
|---|
| 312 |  | 
|---|
| 313 | fUsedEvents++; | 
|---|
| 314 |  | 
|---|
| 315 | MRawEvtPixelIter pixel(fRawEvt); | 
|---|
| 316 |  | 
|---|
| 317 | while (pixel.Next()) | 
|---|
| 318 | { | 
|---|
| 319 | const UInt_t idx = pixel.GetPixelId(); | 
|---|
| 320 |  | 
|---|
| 321 | Float_t sum = 0.; | 
|---|
| 322 | UInt_t  ab0 = 0; | 
|---|
| 323 | UInt_t  ab1 = 0; | 
|---|
| 324 |  | 
|---|
| 325 | if (fExtractor) | 
|---|
| 326 | CalcExtractor(pixel, sum, (*fPedestalsIn)[idx]); | 
|---|
| 327 | else | 
|---|
| 328 | CalcSums(pixel, sum, ab0, ab1); | 
|---|
| 329 |  | 
|---|
| 330 | fSumx[idx] += sum; | 
|---|
| 331 |  | 
|---|
| 332 | if (fIntermediateStorage) | 
|---|
| 333 | (*fPedestalsInter)[idx].Set(sum,0.,0.,fUsedEvents); | 
|---|
| 334 |  | 
|---|
| 335 | const Float_t sqrsum = sum*sum; | 
|---|
| 336 |  | 
|---|
| 337 | fSumx2[idx]  += sqrsum; | 
|---|
| 338 | fSumAB0[idx] += ab0; | 
|---|
| 339 | fSumAB1[idx] += ab1; | 
|---|
| 340 |  | 
|---|
| 341 | if (fUseSpecialPixels) | 
|---|
| 342 | continue; | 
|---|
| 343 |  | 
|---|
| 344 | const UInt_t aidx   = (*fGeom)[idx].GetAidx(); | 
|---|
| 345 | const UInt_t sector = (*fGeom)[idx].GetSector(); | 
|---|
| 346 |  | 
|---|
| 347 | fAreaSumx[aidx]      += sum; | 
|---|
| 348 | fSectorSumx[sector]  += sum; | 
|---|
| 349 |  | 
|---|
| 350 | fAreaSumx2[aidx]     += sqrsum; | 
|---|
| 351 | fSectorSumx2[sector] += sqrsum; | 
|---|
| 352 |  | 
|---|
| 353 | fAreaSumAB0[aidx]    += ab0; | 
|---|
| 354 | fAreaSumAB1[aidx]    += ab1; | 
|---|
| 355 |  | 
|---|
| 356 | fSectorSumAB0[aidx]  += ab0; | 
|---|
| 357 | fSectorSumAB1[aidx]  += ab1; | 
|---|
| 358 | } | 
|---|
| 359 |  | 
|---|
| 360 | fPedestalsOut->SetReadyToSave(); | 
|---|
| 361 |  | 
|---|
| 362 | return kTRUE; | 
|---|
| 363 | } | 
|---|
| 364 |  | 
|---|
| 365 |  | 
|---|
| 366 | void MPedCalcPedRun::CalcExtractor(const MRawEvtPixelIter &pixel, Float_t &sum, MPedestalPix &ped) | 
|---|
| 367 | { | 
|---|
| 368 | const Bool_t abflag = pixel.HasABFlag(); | 
|---|
| 369 |  | 
|---|
| 370 | Byte_t *first  = pixel.GetHiGainSamples() + fExtractWinFirst; | 
|---|
| 371 | Byte_t *logain = pixel.GetLoGainSamples(); | 
|---|
| 372 |  | 
|---|
| 373 | Byte_t  sat = 0; | 
|---|
| 374 |  | 
|---|
| 375 | Float_t dummy; | 
|---|
| 376 | fExtractor->FindTimeAndChargeHiGain(first,logain,sum,dummy,dummy,dummy,sat,ped,abflag); | 
|---|
| 377 | } | 
|---|
| 378 |  | 
|---|
| 379 | void MPedCalcPedRun::CalcSums(const MRawEvtPixelIter &pixel, Float_t &sum, UInt_t &ab0, UInt_t &ab1) | 
|---|
| 380 | { | 
|---|
| 381 |  | 
|---|
| 382 | Byte_t *higain = pixel.GetHiGainSamples() + fExtractWinFirst; | 
|---|
| 383 | Byte_t *ptr = higain; | 
|---|
| 384 | Byte_t *end = ptr + fExtractWinSize; | 
|---|
| 385 |  | 
|---|
| 386 | const Bool_t abflag = pixel.HasABFlag(); | 
|---|
| 387 |  | 
|---|
| 388 | Int_t sumi = 0; | 
|---|
| 389 |  | 
|---|
| 390 | Int_t  cnt = 0; | 
|---|
| 391 | do | 
|---|
| 392 | { | 
|---|
| 393 | sumi += *ptr; | 
|---|
| 394 | if (!pixel.IsABFlagValid()) | 
|---|
| 395 | continue; | 
|---|
| 396 |  | 
|---|
| 397 | const Int_t abFlag = (fExtractWinFirst + abflag + cnt) & 0x1; | 
|---|
| 398 | if (abFlag) | 
|---|
| 399 | ab1 += *ptr; | 
|---|
| 400 | else | 
|---|
| 401 | ab0 += *ptr; | 
|---|
| 402 |  | 
|---|
| 403 | cnt++; | 
|---|
| 404 | } while (++ptr != end); | 
|---|
| 405 |  | 
|---|
| 406 | if (fOverlap != 0) | 
|---|
| 407 | { | 
|---|
| 408 | ptr = pixel.GetLoGainSamples(); | 
|---|
| 409 | end = ptr + fOverlap; | 
|---|
| 410 |  | 
|---|
| 411 | do | 
|---|
| 412 | { | 
|---|
| 413 | sumi += *ptr; | 
|---|
| 414 | if (!pixel.IsABFlagValid()) | 
|---|
| 415 | continue; | 
|---|
| 416 |  | 
|---|
| 417 | const Int_t abFlag = (fExtractWinFirst + abflag + cnt) & 0x1; | 
|---|
| 418 | if (abFlag) | 
|---|
| 419 | ab1 += *ptr; | 
|---|
| 420 | else | 
|---|
| 421 | ab0 += *ptr; | 
|---|
| 422 |  | 
|---|
| 423 | cnt++; | 
|---|
| 424 | } while (++ptr != end); | 
|---|
| 425 | } | 
|---|
| 426 |  | 
|---|
| 427 | sum = (Float_t)sumi; | 
|---|
| 428 | } | 
|---|
| 429 |  | 
|---|
| 430 | // -------------------------------------------------------------------------- | 
|---|
| 431 | // | 
|---|
| 432 | // Compute signal mean and rms in the whole run and store it in MPedestalCam | 
|---|
| 433 | // | 
|---|
| 434 | Int_t MPedCalcPedRun::Finalize() | 
|---|
| 435 | { | 
|---|
| 436 | if (fUsedEvents == 0) | 
|---|
| 437 | return kTRUE; | 
|---|
| 438 |  | 
|---|
| 439 | // | 
|---|
| 440 | // Necessary check for extraction of special pixels | 
|---|
| 441 | // together with data which does not yet have them | 
|---|
| 442 | // | 
|---|
| 443 | if (fSumx.GetSize()==0) | 
|---|
| 444 | return kTRUE; | 
|---|
| 445 |  | 
|---|
| 446 | MRawEvtPixelIter pixel(fRawEvt); | 
|---|
| 447 | while (pixel.Next()) | 
|---|
| 448 | CalcPixResults(fUsedEvents, pixel.GetPixelId()); | 
|---|
| 449 |  | 
|---|
| 450 | if (!fUseSpecialPixels) | 
|---|
| 451 | { | 
|---|
| 452 |  | 
|---|
| 453 | // | 
|---|
| 454 | // Loop over the (two) area indices to get the averaged pedestal per aidx | 
|---|
| 455 | // | 
|---|
| 456 | for (UInt_t aidx=0; aidx<fAreaValid.GetSize(); aidx++) | 
|---|
| 457 | if (fAreaValid[aidx]>0) | 
|---|
| 458 | CalcAreaResults(fUsedEvents, fAreaValid[aidx], aidx); | 
|---|
| 459 |  | 
|---|
| 460 | // | 
|---|
| 461 | // Loop over the (six) sector indices to get the averaged pedestal per sector | 
|---|
| 462 | // | 
|---|
| 463 | for (UInt_t sector=0; sector<fSectorValid.GetSize(); sector++) | 
|---|
| 464 | if (fSectorValid[sector]>0) | 
|---|
| 465 | CalcSectorResults(fUsedEvents, fSectorValid[sector], sector); | 
|---|
| 466 | } | 
|---|
| 467 |  | 
|---|
| 468 | fPedestalsOut->SetTotalEntries(fUsedEvents*fExtractWinSize); | 
|---|
| 469 | fPedestalsOut->SetReadyToSave(); | 
|---|
| 470 |  | 
|---|
| 471 | return kTRUE; | 
|---|
| 472 | } | 
|---|
| 473 |  | 
|---|
| 474 | Int_t MPedCalcPedRun::PostProcess() | 
|---|
| 475 | { | 
|---|
| 476 | if (!fRawEvt) | 
|---|
| 477 | return kTRUE; | 
|---|
| 478 |  | 
|---|
| 479 | if (!Finalize()) | 
|---|
| 480 | return kFALSE; | 
|---|
| 481 |  | 
|---|
| 482 | return MExtractPedestal::PostProcess(); | 
|---|
| 483 | } | 
|---|
| 484 |  | 
|---|
| 485 | //----------------------------------------------------------------------- | 
|---|
| 486 | // | 
|---|
| 487 | // Return if the pedestal bit was set from the calibration trigger box. | 
|---|
| 488 | // The last but one bit is used for the "pedestal-bit". | 
|---|
| 489 | // | 
|---|
| 490 | // This bit is set since run gkFirstRunWithFinalBits | 
|---|
| 491 | // | 
|---|
| 492 | Bool_t MPedCalcPedRun::IsPedBitSet() | 
|---|
| 493 | { | 
|---|
| 494 | if (fRunHeader->GetRunNumber()<gkFirstRunWithFinalBits) | 
|---|
| 495 | return kFALSE; | 
|---|
| 496 |  | 
|---|
| 497 | if (!fTrigPattern) | 
|---|
| 498 | return kFALSE; | 
|---|
| 499 |  | 
|---|
| 500 | return (fTrigPattern->GetPrescaled() & MTriggerPattern::kPedestal) ? kTRUE : kFALSE; | 
|---|
| 501 | } | 
|---|
| 502 |  | 
|---|
| 503 | void MPedCalcPedRun::Print(Option_t *o) const | 
|---|
| 504 | { | 
|---|
| 505 | MExtractPedestal::Print(o); | 
|---|
| 506 |  | 
|---|
| 507 | const Int_t last = fExtractor | 
|---|
| 508 | ? fExtractWinFirst + fExtractor->GetWindowSizeHiGain() -1 | 
|---|
| 509 | : fExtractWinLast; | 
|---|
| 510 |  | 
|---|
| 511 | *fLog << "ExtractWindow from slice      " << fExtractWinFirst << " to " << last << " incl." << endl; | 
|---|
| 512 | *fLog << "Num overlap lo-gain slices:   " << fOverlap << endl; | 
|---|
| 513 | *fLog << "First pedrun out of sequence: " << (fIsFirstPedRun?"yes":"no") << endl; | 
|---|
| 514 | *fLog << "Number of used events so far: " << fUsedEvents << endl; | 
|---|
| 515 | } | 
|---|