| 33 |
|
fPileupInfoName("PileupInfo"), |
| 34 |
|
fDoPUInfo(kFALSE), |
| 35 |
|
hNPU(0), |
| 36 |
< |
hNPU50ns(0) |
| 36 |
> |
hNPU50ns(0), |
| 37 |
> |
hNPUTrue(0), |
| 38 |
> |
fMCEventInfo(0), |
| 39 |
> |
fMCEventInfoName(Names::gkMCEvtInfoBrn), |
| 40 |
> |
hDTotalMCWeight(0), |
| 41 |
> |
hNPURunABObs(0), |
| 42 |
> |
hNPURunCObs(0), |
| 43 |
> |
hNPURunDObs(0), |
| 44 |
> |
hNPURunABTrue(0), |
| 45 |
> |
hNPURunCTrue(0), |
| 46 |
> |
hNPURunDTrue(0) |
| 47 |
|
{ |
| 48 |
|
// Constructor. |
| 49 |
|
} |
| 108 |
|
return; |
| 109 |
|
} |
| 110 |
|
fAllHeadTree->GetEntry(fCurEnt++); |
| 111 |
< |
while(fCurEnt<=nemax && fAllEventHeader->Skimmed()) { |
| 111 |
> |
while (fCurEnt <= nemax && fAllEventHeader->Skimmed()) { |
| 112 |
|
EventHeader *eh = fAllHeaders.AddNew(); |
| 113 |
< |
eh->SetRunNum(fAllEventHeader->RunNum()); |
| 114 |
< |
eh->SetEvtNum(fAllEventHeader->EvtNum()); |
| 115 |
< |
eh->SetLumiSec(fAllEventHeader->LumiSec()); |
| 113 |
> |
eh->SetRunNum (fAllEventHeader->RunNum()); |
| 114 |
> |
eh->SetEvtNum (fAllEventHeader->EvtNum()); |
| 115 |
> |
eh->SetLumiSec (fAllEventHeader->LumiSec()); |
| 116 |
|
eh->SetRunEntry(fAllEventHeader->RunEntry()); |
| 117 |
< |
eh->SetSkimmed(fAllEventHeader->Skimmed()); |
| 117 |
> |
eh->SetSkimmed (fAllEventHeader->Skimmed()); |
| 118 |
|
fAllHeadTree->GetEntry(fCurEnt++); |
| 119 |
|
} |
| 120 |
< |
if ((fAllEventHeader->RunNum()!=curev->RunNum()) || |
| 121 |
< |
(fAllEventHeader->EvtNum()!=curev->EvtNum()) || |
| 122 |
< |
(fAllEventHeader->LumiSec()!=curev->LumiSec()) || |
| 123 |
< |
(fAllEventHeader->RunEntry()!=curev->RunEntry())) { |
| 120 |
> |
if ((fAllEventHeader->RunNum() != curev->RunNum()) || |
| 121 |
> |
(fAllEventHeader->EvtNum() != curev->EvtNum()) || |
| 122 |
> |
(fAllEventHeader->LumiSec() != curev->LumiSec()) || |
| 123 |
> |
(fAllEventHeader->RunEntry() != curev->RunEntry())) { |
| 124 |
|
SendError(kWarning, "CopyAllEventHeaders", |
| 125 |
|
"Event header information for entry %d inconsistent: " |
| 126 |
|
"%d==%d, %d==%d, %d==%d, %d==%d", |
| 136 |
|
if (fCurEnt<nemax) { |
| 137 |
|
Int_t testEnt = fCurEnt; |
| 138 |
|
fAllHeadTree->GetEntry(testEnt++); |
| 139 |
< |
while(testEnt<=nemax && fAllEventHeader->Skimmed()) |
| 139 |
> |
while (testEnt<=nemax && fAllEventHeader->Skimmed()) |
| 140 |
|
fAllHeadTree->GetEntry(testEnt++); |
| 141 |
|
if (testEnt==nemax+1) { // need to add remaining skimmed events |
| 142 |
|
fAllHeadTree->GetEntry(fCurEnt++); |
| 143 |
|
while(fCurEnt<=nemax) { |
| 144 |
|
EventHeader *eh = fAllHeaders.AddNew(); |
| 145 |
< |
eh->SetRunNum(fAllEventHeader->RunNum()); |
| 146 |
< |
eh->SetEvtNum(fAllEventHeader->EvtNum()); |
| 147 |
< |
eh->SetLumiSec(fAllEventHeader->LumiSec()); |
| 145 |
> |
eh->SetRunNum (fAllEventHeader->RunNum()); |
| 146 |
> |
eh->SetEvtNum (fAllEventHeader->EvtNum()); |
| 147 |
> |
eh->SetLumiSec (fAllEventHeader->LumiSec()); |
| 148 |
|
eh->SetRunEntry(fAllEventHeader->RunEntry()); |
| 149 |
< |
eh->SetSkimmed(fAllEventHeader->Skimmed()); |
| 149 |
> |
eh->SetSkimmed (fAllEventHeader->Skimmed()); |
| 150 |
|
fAllHeadTree->GetEntry(fCurEnt++); |
| 151 |
|
} |
| 152 |
|
if (fCurEnt != nemax+1) { |
| 220 |
|
|
| 221 |
|
if (GetEventHeader()->IsMC()) { |
| 222 |
|
LoadBranch(fPileupInfoName); |
| 223 |
< |
Int_t npu[3] = {0,0,0}; |
| 223 |
> |
Double_t npu[4] = {0.,0.,0.,0.}; |
| 224 |
|
for (UInt_t i=0; i<fPileupInfo->GetEntries(); ++i) { |
| 225 |
|
const PileupInfo *puinfo = fPileupInfo->At(i); |
| 226 |
|
if (puinfo->GetBunchCrossing()==0) npu[0]= puinfo->GetPU_NumInteractions(); |
| 227 |
|
else if (puinfo->GetBunchCrossing()==-1) npu[1] = puinfo->GetPU_NumInteractions(); |
| 228 |
|
else if (puinfo->GetBunchCrossing()==1) npu[2] = puinfo->GetPU_NumInteractions(); |
| 229 |
+ |
if (puinfo->GetBunchCrossing()==0) npu[3]= puinfo->GetPU_NumMean(); |
| 230 |
|
} |
| 231 |
|
|
| 232 |
< |
hNPU->Fill(npu[0]); |
| 233 |
< |
hNPU50ns->Fill(npu[0],npu[1],npu[2]); |
| 232 |
> |
LoadBranch(fMCEventInfoName); |
| 233 |
> |
double mcweight = fMCEventInfo->Weight(); |
| 234 |
> |
|
| 235 |
> |
hNPU->Fill(npu[0],mcweight); |
| 236 |
> |
hNPU50ns->Fill(npu[0],npu[1],npu[2],mcweight); |
| 237 |
> |
hNPUTrue->Fill(npu[3],mcweight); |
| 238 |
> |
|
| 239 |
> |
UInt_t run = GetEventHeader()->RunNum(); |
| 240 |
> |
|
| 241 |
> |
//Josh: fill pileup histograms for 2012 run-dependent Monte Carlo which currently has one of three run numbers |
| 242 |
> |
//More generic solution to be implemented depending on future run/lumi dependent Monte Carlo production strategy |
| 243 |
> |
if (run==194533) { |
| 244 |
> |
hNPURunABObs->Fill(npu[0],mcweight); |
| 245 |
> |
hNPURunABTrue->Fill(npu[3],mcweight); |
| 246 |
> |
} |
| 247 |
> |
else if (run==200519) { |
| 248 |
> |
hNPURunCObs->Fill(npu[0],mcweight); |
| 249 |
> |
hNPURunCTrue->Fill(npu[3],mcweight); |
| 250 |
> |
} |
| 251 |
> |
else if (run==206859) { |
| 252 |
> |
hNPURunDObs->Fill(npu[0],mcweight); |
| 253 |
> |
hNPURunDTrue->Fill(npu[3],mcweight); |
| 254 |
> |
} |
| 255 |
> |
|
| 256 |
> |
hDTotalMCWeight->Fill(0., mcweight); |
| 257 |
> |
|
| 258 |
|
} |
| 259 |
|
|
| 260 |
|
|
| 286 |
|
} |
| 287 |
|
|
| 288 |
|
ReqBranch(fPileupInfoName, fPileupInfo); |
| 289 |
+ |
ReqBranch(fMCEventInfoName, fMCEventInfo); |
| 290 |
|
|
| 291 |
< |
hNPU = new TH1D("hNPU", "hNPU", 51, -0.5, 50.5); |
| 291 |
> |
hNPU = new TH1D("hNPU", "hNPU", 201, -0.5, 200.5); |
| 292 |
|
AddOutput(hNPU); |
| 293 |
|
|
| 294 |
< |
hNPU50ns = new TH3D("hNPU50ns", "hNPU50ns", 51, -0.5, 50.5, 51, -0.5, 50.5, 51, -0.5, 50.5); |
| 294 |
> |
hNPU50ns = new TH3D("hNPU50ns", "hNPU50ns", 201, -0.5, 200.5, 201, -0.5, 200.5, 201, -0.5, 200.5); |
| 295 |
|
AddOutput(hNPU50ns); |
| 296 |
|
|
| 297 |
+ |
hNPUTrue = new TH1D("hNPUTrue", "hNPUTrue", 2000, 0.0, 200.0); |
| 298 |
+ |
AddOutput(hNPUTrue); |
| 299 |
+ |
|
| 300 |
+ |
hDTotalMCWeight = new TH1D("hDTotalMCWeight","hDTotalMCWeight",1,-0.5,0.5); |
| 301 |
+ |
AddOutput(hDTotalMCWeight); |
| 302 |
+ |
|
| 303 |
+ |
hNPURunABObs = new TH1D("hNPURunABObs","hNPURunABObs",201, -0.5, 200.5); |
| 304 |
+ |
AddOutput(hNPURunABObs); |
| 305 |
+ |
|
| 306 |
+ |
hNPURunCObs = new TH1D("hNPURunCObs","hNPURunCObs",201, -0.5, 200.5); |
| 307 |
+ |
AddOutput(hNPURunCObs); |
| 308 |
+ |
|
| 309 |
+ |
hNPURunDObs = new TH1D("hNPURunDObs","hNPURunDObs",201, -0.5, 200.5); |
| 310 |
+ |
AddOutput(hNPURunDObs); |
| 311 |
+ |
|
| 312 |
+ |
hNPURunABTrue = new TH1D("hNPURunABTrue","hNPURunABTrue",2000, 0.0, 200.0); |
| 313 |
+ |
AddOutput(hNPURunABTrue); |
| 314 |
+ |
|
| 315 |
+ |
hNPURunCTrue = new TH1D("hNPURunCTrue","hNPURunCTrue",2000, 0.0, 200.0); |
| 316 |
+ |
AddOutput(hNPURunCTrue); |
| 317 |
+ |
|
| 318 |
+ |
hNPURunDTrue = new TH1D("hNPURunDTrue","hNPURunDTrue",2000, 0.0, 200.0); |
| 319 |
+ |
AddOutput(hNPURunDTrue); |
| 320 |
+ |
|
| 321 |
|
} |
| 322 |
|
|
| 323 |
|
//-------------------------------------------------------------------------------------------------- |
