| 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 << warn << GetDescriptor()
|
|---|
| 223 | << ": MTriggerPattern not found... Cannot use interlaced pedestal events." << endl;
|
|---|
| 224 |
|
|---|
| 225 | return MExtractPedestal::PreProcess(pList);
|
|---|
| 226 | }
|
|---|
| 227 |
|
|---|
| 228 | // --------------------------------------------------------------------------
|
|---|
| 229 | //
|
|---|
| 230 | // The run type is checked for "kRTPedestal"
|
|---|
| 231 | // and the variable fIsNotPedRun is set in that case
|
|---|
| 232 | //
|
|---|
| 233 | Bool_t MPedCalcPedRun::ReInit(MParList *pList)
|
|---|
| 234 | {
|
|---|
| 235 |
|
|---|
| 236 | if (!MExtractPedestal::ReInit(pList))
|
|---|
| 237 | return kFALSE;
|
|---|
| 238 |
|
|---|
| 239 | CheckExtractionWindow();
|
|---|
| 240 |
|
|---|
| 241 | //
|
|---|
| 242 | // If this is the first ped run, the next run (call to ReInit)
|
|---|
| 243 | // is not the first anymore
|
|---|
| 244 | //
|
|---|
| 245 | if (fRunHeader->GetRunType()==MRawRunHeader::kRTPedestal)
|
|---|
| 246 | {
|
|---|
| 247 | fIsFirstPedRun = kFALSE;
|
|---|
| 248 | fIsNotPedRun = kFALSE;
|
|---|
| 249 | return kTRUE;
|
|---|
| 250 | }
|
|---|
| 251 |
|
|---|
| 252 | fIsNotPedRun = kTRUE;
|
|---|
| 253 | //
|
|---|
| 254 | // If this is the first call to ReInit (before reading the first file)
|
|---|
| 255 | // nothing should be done. It occurs for the case that the first treated
|
|---|
| 256 | // file is not of pedestal type.
|
|---|
| 257 | //
|
|---|
| 258 | if (fIsFirstPedRun)
|
|---|
| 259 | return kTRUE;
|
|---|
| 260 |
|
|---|
| 261 | //
|
|---|
| 262 | // In the other case, produce the MPedestalCam to be use the subsequent (non-pedestal) events
|
|---|
| 263 | //
|
|---|
| 264 | *fLog << inf << "Finalizing pedestal calculations..." << flush;
|
|---|
| 265 |
|
|---|
| 266 | if (!Finalize())
|
|---|
| 267 | return kFALSE;
|
|---|
| 268 |
|
|---|
| 269 | Reset();
|
|---|
| 270 |
|
|---|
| 271 | return kTRUE;
|
|---|
| 272 | }
|
|---|
| 273 |
|
|---|
| 274 | // --------------------------------------------------------------------------
|
|---|
| 275 | //
|
|---|
| 276 | // Return kTRUE (without doing anything) in case that the run type is not
|
|---|
| 277 | // equal to 1 (pedestal run)
|
|---|
| 278 | //
|
|---|
| 279 | // Fill the MPedestalCam container with the signal mean and rms for the event.
|
|---|
| 280 | // Store the measured signal in arrays fSumx and fSumx2 so that we can
|
|---|
| 281 | // calculate the overall mean and rms in the PostProcess()
|
|---|
| 282 | //
|
|---|
| 283 | Int_t MPedCalcPedRun::Calc()
|
|---|
| 284 | {
|
|---|
| 285 |
|
|---|
| 286 | if (fIsNotPedRun && !IsPedBitSet())
|
|---|
| 287 | return kTRUE;
|
|---|
| 288 |
|
|---|
| 289 | // if (fUsedEvents == fNumEventsDump)
|
|---|
| 290 | // {
|
|---|
| 291 | // *fLog << endl;
|
|---|
| 292 | // *fLog << inf << GetDescriptor() << " : Finalize pedestal calculations..." << flush;
|
|---|
| 293 | // Finalize();
|
|---|
| 294 | // Reset();
|
|---|
| 295 | // }
|
|---|
| 296 |
|
|---|
| 297 | fUsedEvents++;
|
|---|
| 298 |
|
|---|
| 299 | MRawEvtPixelIter pixel(fRawEvt);
|
|---|
| 300 |
|
|---|
| 301 | while (pixel.Next())
|
|---|
| 302 | {
|
|---|
| 303 | const UInt_t idx = pixel.GetPixelId();
|
|---|
| 304 | const UInt_t aidx = (*fGeom)[idx].GetAidx();
|
|---|
| 305 | const UInt_t sector = (*fGeom)[idx].GetSector();
|
|---|
| 306 |
|
|---|
| 307 | Float_t sum = 0.;
|
|---|
| 308 | UInt_t ab0 = 0;
|
|---|
| 309 | UInt_t ab1 = 0;
|
|---|
| 310 |
|
|---|
| 311 | if (fExtractor)
|
|---|
| 312 | CalcExtractor(pixel, sum, (*fPedestalsIn)[idx]);
|
|---|
| 313 | else
|
|---|
| 314 | CalcSums(pixel, sum, ab0, ab1);
|
|---|
| 315 |
|
|---|
| 316 | fSumx[idx] += sum;
|
|---|
| 317 | fAreaSumx[aidx] += sum;
|
|---|
| 318 | fSectorSumx[sector] += sum;
|
|---|
| 319 |
|
|---|
| 320 | const Float_t sqrsum = sum*sum;
|
|---|
| 321 | fSumx2[idx] += sqrsum;
|
|---|
| 322 | fAreaSumx2[aidx] += sqrsum;
|
|---|
| 323 | fSectorSumx2[sector] += sqrsum;
|
|---|
| 324 |
|
|---|
| 325 | fSumAB0[idx] += ab0;
|
|---|
| 326 | fSumAB1[idx] += ab1;
|
|---|
| 327 |
|
|---|
| 328 | fAreaSumAB0[aidx] += ab0;
|
|---|
| 329 | fAreaSumAB1[aidx] += ab1;
|
|---|
| 330 |
|
|---|
| 331 | fSectorSumAB0[aidx] += ab0;
|
|---|
| 332 | fSectorSumAB1[aidx] += ab1;
|
|---|
| 333 | }
|
|---|
| 334 |
|
|---|
| 335 | fPedestalsOut->SetReadyToSave();
|
|---|
| 336 |
|
|---|
| 337 | return kTRUE;
|
|---|
| 338 | }
|
|---|
| 339 |
|
|---|
| 340 |
|
|---|
| 341 | void MPedCalcPedRun::CalcExtractor(const MRawEvtPixelIter &pixel, Float_t &sum, MPedestalPix &ped)
|
|---|
| 342 | {
|
|---|
| 343 | const Bool_t abflag = pixel.HasABFlag();
|
|---|
| 344 |
|
|---|
| 345 | Byte_t *first = pixel.GetHiGainSamples() + fExtractWinFirst;
|
|---|
| 346 | Byte_t *logain = pixel.GetLoGainSamples();
|
|---|
| 347 |
|
|---|
| 348 | Byte_t sat = 0;
|
|---|
| 349 |
|
|---|
| 350 | Float_t dummy;
|
|---|
| 351 | fExtractor->FindTimeAndChargeHiGain(first,logain,sum,dummy,dummy,dummy,sat,ped,abflag);
|
|---|
| 352 | }
|
|---|
| 353 |
|
|---|
| 354 | void MPedCalcPedRun::CalcSums(const MRawEvtPixelIter &pixel, Float_t &sum, UInt_t &ab0, UInt_t &ab1)
|
|---|
| 355 | {
|
|---|
| 356 |
|
|---|
| 357 | Byte_t *higain = pixel.GetHiGainSamples() + fExtractWinFirst;
|
|---|
| 358 | Byte_t *ptr = higain;
|
|---|
| 359 | Byte_t *end = ptr + fExtractWinSize;
|
|---|
| 360 |
|
|---|
| 361 | const Bool_t abflag = pixel.HasABFlag();
|
|---|
| 362 |
|
|---|
| 363 | Int_t sumi = 0;
|
|---|
| 364 |
|
|---|
| 365 | Int_t cnt = 0;
|
|---|
| 366 | do
|
|---|
| 367 | {
|
|---|
| 368 | sumi += *ptr;
|
|---|
| 369 | if (!pixel.IsABFlagValid())
|
|---|
| 370 | continue;
|
|---|
| 371 |
|
|---|
| 372 | const Int_t abFlag = (fExtractWinFirst + abflag + cnt) & 0x1;
|
|---|
| 373 | if (abFlag)
|
|---|
| 374 | ab1 += *ptr;
|
|---|
| 375 | else
|
|---|
| 376 | ab0 += *ptr;
|
|---|
| 377 |
|
|---|
| 378 | cnt++;
|
|---|
| 379 | } while (++ptr != end);
|
|---|
| 380 |
|
|---|
| 381 | if (fOverlap != 0)
|
|---|
| 382 | {
|
|---|
| 383 | ptr = pixel.GetLoGainSamples();
|
|---|
| 384 | end = ptr + fOverlap;
|
|---|
| 385 |
|
|---|
| 386 | do
|
|---|
| 387 | {
|
|---|
| 388 | sumi += *ptr;
|
|---|
| 389 | if (!pixel.IsABFlagValid())
|
|---|
| 390 | continue;
|
|---|
| 391 |
|
|---|
| 392 | const Int_t abFlag = (fExtractWinFirst + abflag + cnt) & 0x1;
|
|---|
| 393 | if (abFlag)
|
|---|
| 394 | ab1 += *ptr;
|
|---|
| 395 | else
|
|---|
| 396 | ab0 += *ptr;
|
|---|
| 397 |
|
|---|
| 398 | cnt++;
|
|---|
| 399 | } while (++ptr != end);
|
|---|
| 400 | }
|
|---|
| 401 |
|
|---|
| 402 | sum = (Float_t)sumi;
|
|---|
| 403 | }
|
|---|
| 404 |
|
|---|
| 405 |
|
|---|
| 406 | // --------------------------------------------------------------------------
|
|---|
| 407 | //
|
|---|
| 408 | // Compute signal mean and rms in the whole run and store it in MPedestalCam
|
|---|
| 409 | //
|
|---|
| 410 | Int_t MPedCalcPedRun::Finalize()
|
|---|
| 411 | {
|
|---|
| 412 |
|
|---|
| 413 | if (fUsedEvents == 0)
|
|---|
| 414 | return kTRUE;
|
|---|
| 415 |
|
|---|
| 416 | MRawEvtPixelIter pixel(fRawEvt);
|
|---|
| 417 | while (pixel.Next())
|
|---|
| 418 | CalcPixResults(fUsedEvents, pixel.GetPixelId());
|
|---|
| 419 |
|
|---|
| 420 | //
|
|---|
| 421 | // Loop over the (two) area indices to get the averaged pedestal per aidx
|
|---|
| 422 | //
|
|---|
| 423 | for (UInt_t aidx=0; aidx<fAreaValid.GetSize(); aidx++)
|
|---|
| 424 | if (fAreaValid[aidx]>0)
|
|---|
| 425 | CalcAreaResults(fUsedEvents, fAreaValid[aidx], aidx);
|
|---|
| 426 |
|
|---|
| 427 | //
|
|---|
| 428 | // Loop over the (six) sector indices to get the averaged pedestal per sector
|
|---|
| 429 | //
|
|---|
| 430 | for (UInt_t sector=0; sector<fSectorValid.GetSize(); sector++)
|
|---|
| 431 | if (fSectorValid[sector]>0)
|
|---|
| 432 | CalcSectorResults(fUsedEvents, fSectorValid[sector], sector);
|
|---|
| 433 |
|
|---|
| 434 | fPedestalsOut->SetTotalEntries(fUsedEvents*fExtractWinSize);
|
|---|
| 435 | fPedestalsOut->SetReadyToSave();
|
|---|
| 436 |
|
|---|
| 437 | return kTRUE;
|
|---|
| 438 | }
|
|---|
| 439 |
|
|---|
| 440 | Int_t MPedCalcPedRun::PostProcess()
|
|---|
| 441 | {
|
|---|
| 442 | if (!Finalize())
|
|---|
| 443 | return kFALSE;
|
|---|
| 444 |
|
|---|
| 445 | return MExtractPedestal::PostProcess();
|
|---|
| 446 | }
|
|---|
| 447 |
|
|---|
| 448 | //-------------------------------------------------------------
|
|---|
| 449 | //
|
|---|
| 450 | // Return if the pedestal bit was set from the calibration trigger box.
|
|---|
| 451 | // The last but one bit is used for the "pedestal-bit".
|
|---|
| 452 | //
|
|---|
| 453 | // This bit is set since run gkFirstRunWithFinalBits
|
|---|
| 454 | //
|
|---|
| 455 | Bool_t MPedCalcPedRun::IsPedBitSet()
|
|---|
| 456 | {
|
|---|
| 457 |
|
|---|
| 458 | if (!fTrigPattern)
|
|---|
| 459 | return kTRUE;
|
|---|
| 460 |
|
|---|
| 461 | if (fRunHeader->GetRunNumber() < gkFirstRunWithFinalBits)
|
|---|
| 462 | return kTRUE;
|
|---|
| 463 |
|
|---|
| 464 | return (fTrigPattern->GetPrescaled() & MTriggerPattern::kPedestal) ? kTRUE : kFALSE;
|
|---|
| 465 | }
|
|---|
| 466 |
|
|---|
| 467 | void MPedCalcPedRun::Print(Option_t *o) const
|
|---|
| 468 | {
|
|---|
| 469 |
|
|---|
| 470 | MExtractPedestal::Print(o);
|
|---|
| 471 |
|
|---|
| 472 | const Int_t last = fExtractor
|
|---|
| 473 | ? fExtractWinFirst + fExtractor->GetWindowSizeHiGain() -1
|
|---|
| 474 | : fExtractWinLast;
|
|---|
| 475 |
|
|---|
| 476 | *fLog << "ExtractWindow from slice " << fExtractWinFirst << " to " << last << " incl." << endl;
|
|---|
| 477 | *fLog << "Num overlap lo-gain slices: " << fOverlap << endl;
|
|---|
| 478 | *fLog << "First pedrun out of sequence: " << (fIsFirstPedRun?"yes":"no") << endl;
|
|---|
| 479 | *fLog << "Number of used events so far: " << fUsedEvents << endl;
|
|---|
| 480 | }
|
|---|