Loading [MathJax]/extensions/tex2jax.js
ATLAS Offline Software
All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Properties Friends Macros Modules Pages
Functions
FPGATrackSimLayerStudyTool.cxx File Reference
#include "FPGATrackSimBinning/FPGATrackSimLayerStudyTool.h"
#include "AthenaBaseComps/AthMsgStreamMacros.h"
#include "FPGATrackSimBinning/IFPGATrackSimBinDesc.h"
#include "FPGATrackSimBinning/FPGATrackSimBinUtil.h"
#include "FPGATrackSimBinning/FPGATrackSimBinnedHits.h"
#include "TH1D.h"
#include "TH2D.h"
#include "TTree.h"
#include <bit>
Include dependency graph for FPGATrackSimLayerStudyTool.cxx:

Go to the source code of this file.

Functions

void FPGATrackSimLayerStudyTool::fillBinLevelOutput ATLAS_NOT_THREAD_SAFE (const FPGATrackSimBinUtil::IdxSet &idx, const FPGATrackSimBinnedHits::BinEntry &data)
 
void FPGATrackSimLayerStudyTool::fillBinningSummary ATLAS_NOT_THREAD_SAFE (const std::vector< std::shared_ptr< const FPGATrackSimHit >> &hits)
 
void FPGATrackSimLayerStudyTool::parseTruthInfo ATLAS_NOT_THREAD_SAFE (std::vector< FPGATrackSimTruthTrack > const &truthtracks)
 

Function Documentation

◆ ATLAS_NOT_THREAD_SAFE() [1/3]

void FPGATrackSimLayerStudyTool::fillBinLevelOutput ATLAS_NOT_THREAD_SAFE ( const FPGATrackSimBinUtil::IdxSet idx,
const FPGATrackSimBinnedHits::BinEntry data 
)

Definition at line 119 of file FPGATrackSimLayerStudyTool.cxx.

121 {
122  setBinPlotsActive(idx);
123 
124  if (m_binPlotsActive) {
125  for (auto& hit : data.hits) {
126  m_phiShift_road->Fill(hit.phiShift);
127  m_etaShift_road->Fill(hit.etaShift);
128  m_phiShift2D_road->Fill(hit.phiShift, hit.hitptr->getR());
129  m_etaShift2D_road->Fill(hit.etaShift, hit.hitptr->getR());
130  }
131 
132  // Module mapping and Layer definition studies
133  // first sort hits by r+z radii
134  std::vector<FPGATrackSimBinUtil::StoredHit> sorted_hits = data.hits;
135  std::sort(sorted_hits.begin(), sorted_hits.end(),
136  [](const auto &hit1, const auto &hit2) {
137  return hit1.rzrad() < hit2.rzrad();
138  });
139 
140  // Fill tree
141  m_tree_bin = std::vector<unsigned>(idx);
142  ClearTreeVectors();
143  for (auto &hit : sorted_hits) {
144  m_tree_r.push_back(hit.hitptr->getR());
145  m_tree_z.push_back(hit.hitptr->getZ());
146  m_tree_id.push_back(hit.hitptr->getIdentifier());
147  m_tree_hash.push_back(hit.hitptr->getIdentifierHash());
148  m_tree_layer.push_back(hit.hitptr->getLayerDisk());
149  m_tree_side.push_back(hit.hitptr->getSide());
150  m_tree_etamod.push_back(hit.hitptr->getEtaModule());
151  m_tree_phimod.push_back(hit.hitptr->getPhiModule());
152  m_tree_dettype.push_back((int)hit.hitptr->getDetType());
153  m_tree_detzone.push_back((int)hit.hitptr->getDetectorZone());
154  }
155  m_bin_module_tree->Fill();
156  }
157 }

◆ ATLAS_NOT_THREAD_SAFE() [2/3]

void FPGATrackSimLayerStudyTool::fillBinningSummary ATLAS_NOT_THREAD_SAFE ( const std::vector< std::shared_ptr< const FPGATrackSimHit >> &  hits)

Definition at line 159 of file FPGATrackSimLayerStudyTool.cxx.

161 {
162  m_inputHits->Fill(hits.size());
163 
164  for (auto &step : m_binnedhits->getBinTool().steps()) {
165  for (auto bin : m_binnedhits->binnedHits()[step->stepNum()])
166  m_hitsPerStepBin[step->stepNum()]->Fill(bin.data().hitCnt);
167  }
168 
169  for (auto bin :m_binnedhits->binnedHits()[m_binnedhits->getBinTool().lastStep()->stepNum()]) {
170  for (unsigned lyr = 0; lyr < m_binnedhits->getNLayers(); lyr++) {
171  unsigned cnt = bin.data().hitsInLyr(lyr);
172  m_hitsPerLayer->Fill(lyr, cnt);
173  m_hitsPerLayer2D->Fill(lyr, cnt);
174  }
175  }
176 }

◆ ATLAS_NOT_THREAD_SAFE() [3/3]

void FPGATrackSimLayerStudyTool::parseTruthInfo ATLAS_NOT_THREAD_SAFE ( std::vector< FPGATrackSimTruthTrack > const truthtracks)

Definition at line 179 of file FPGATrackSimLayerStudyTool.cxx.

179  {
180  ATH_MSG_DEBUG("In parseTruthInfo, truthtracks size = " << truthtracks.size());
181  m_truthIsValid = false;
182 
183  const IFPGATrackSimBinDesc* bindesc = m_binnedhits->getBinTool().binDesc();
184 
185  if (truthtracks.size() == 0) return;
186 
187  // Convert to binning parameters and find truth bin for each step
188  m_truthpars = (truthtracks)[0].getPars();
189  m_truthpars[FPGATrackSimTrackPars::IHIP] =
190  m_truthpars[FPGATrackSimTrackPars::IHIP] * 1000;
191  m_truthparset = bindesc->trackParsToParSet(m_truthpars);
192  for (auto &step : m_binnedhits->getBinTool().steps()) {
193  m_truthbin.push_back(step->binIdx(m_truthparset));
194  }
195 
196  // histogram parameters
197  for (unsigned i = 0; i < FPGATrackSimTrackPars::NPARS; i++) {
198  m_truthpars_hists[i]->Fill(m_truthparset[i]);
199  }
200 
201  // a closure test
202  FPGATrackSimTrackPars recovered = bindesc->parSetToTrackPars(m_truthparset);
203  ATH_MSG_DEBUG("parset:" << m_truthparset << " " << m_truthpars
204  << " ?= " << recovered << " closure:"
205  << " " << recovered[FPGATrackSimTrackPars::IHIP] - m_truthpars[FPGATrackSimTrackPars::IHIP]
206  << " " << recovered[FPGATrackSimTrackPars::IPHI] - m_truthpars[FPGATrackSimTrackPars::IPHI]
207  << " " << recovered[FPGATrackSimTrackPars::ID0] - m_truthpars[FPGATrackSimTrackPars::ID0]
208  << " " << recovered[FPGATrackSimTrackPars::IETA] - m_truthpars[FPGATrackSimTrackPars::IETA]
209  << " " << recovered[FPGATrackSimTrackPars::IZ0] - m_truthpars[FPGATrackSimTrackPars::IZ0]);
210 
211  // print if there are multiple tracks for debugging single track MC
212  if (truthtracks.size() > 1) {
213  for (unsigned i = 0; i < truthtracks.size(); i++) {
214  ATH_MSG_INFO("Multiple truth" << i << " of " << truthtracks.size()
215  << " " << (truthtracks)[i].getPars());
216  }
217  }
218 
219  // find truth bin for later plotting selections
220  ATH_MSG_DEBUG("truthbin " << truthtracks.size()
221  << " " << m_truthpars << " " << m_truthbin);
222 
223  // Check if the truth track falls in the binning range
224  if (!m_binnedhits->getBinTool().inRange(m_truthparset)) {
225  ATH_MSG_INFO("Truth out of range");
226  return;
227  }
228 
229  // Check that truth track falls in an actual bin
230  // this should alway pass, except for weird events
231  m_truthIsValid = true;
232  for (auto &step : m_binnedhits->getBinTool().steps()) {
233  if (!step->validBinsFull()[m_truthbin[step->stepNum()]]) {
234  ATH_MSG_INFO("Truth Bin not valid! Step " << step->stepName() << " "
235  << m_truthbin[step->stepNum()]
236  << " : " << m_truthpars);
237  std::vector<FPGATrackSimBinUtil::IdxSet> idxsets =
239  std::vector<unsigned>({0, 1, 2, 3, 4}),
240  m_truthbin[step->stepNum()]);
241  for (FPGATrackSimBinUtil::IdxSet &idxset : idxsets) {
242  ATH_MSG_INFO("Truth Box "
243  << bindesc->parSetToTrackPars(step->binLowEdge(idxset)));
244  }
245  m_truthIsValid = false;
246  }
247  }
248 }
FPGATrackSimTrackPars::IHIP
@ IHIP
Definition: FPGATrackSimTrackPars.h:49
data
char data[hepevt_bytes_allocation_ATLAS]
Definition: HepEvt.cxx:11
FPGATrackSimTrackPars::ID0
@ ID0
Definition: FPGATrackSimTrackPars.h:49
TRTCalib_Extractor.hits
hits
Definition: TRTCalib_Extractor.py:35
ATH_MSG_INFO
#define ATH_MSG_INFO(x)
Definition: AthMsgStreamMacros.h:31
FPGATrackSimTrackPars
Definition: FPGATrackSimTrackPars.h:22
FPGATrackSimTrackPars::IZ0
@ IZ0
Definition: FPGATrackSimTrackPars.h:49
bin
Definition: BinsDiffFromStripMedian.h:43
lumiFormat.i
int i
Definition: lumiFormat.py:85
ATH_MSG_DEBUG
#define ATH_MSG_DEBUG(x)
Definition: AthMsgStreamMacros.h:29
IFPGATrackSimBinDesc::trackParsToParSet
virtual const ParSet trackParsToParSet(const FPGATrackSimTrackPars &pars) const =0
FPGATrackSimBinUtil::makeVariationSet
std::vector< IdxSet > makeVariationSet(const std::vector< unsigned > &scanpars, const IdxSet &idx)
Definition: FPGATrackSimBinUtil.cxx:92
IFPGATrackSimBinDesc::parSetToTrackPars
virtual const FPGATrackSimTrackPars parSetToTrackPars(const ParSet &parset) const =0
FPGATrackSimTrackPars::IPHI
@ IPHI
Definition: FPGATrackSimTrackPars.h:49
trigbs_pickEvents.cnt
cnt
Definition: trigbs_pickEvents.py:71
std::sort
void sort(typename std::reverse_iterator< DataModel_detail::iterator< DVL > > beg, typename std::reverse_iterator< DataModel_detail::iterator< DVL > > end, const Compare &comp)
Specialization of sort for DataVector/List.
Definition: DVL_algorithms.h:623
FPGATrackSimTrackPars::NPARS
@ NPARS
Definition: FPGATrackSimTrackPars.h:49
IFPGATrackSimBinDesc
Definition: IFPGATrackSimBinDesc.h:50
LArNewCalib_DelayDump_OFC_Cali.idx
idx
Definition: LArNewCalib_DelayDump_OFC_Cali.py:69
LArCellBinning.step
step
Definition: LArCellBinning.py:158
FPGATrackSimBinUtil::IdxSet
Definition: FPGATrackSimBinUtil.h:50
FPGATrackSimTrackPars::IETA
@ IETA
Definition: FPGATrackSimTrackPars.h:49