43 std::unique_ptr<TFile>
f( TFile::Open(
fileName.c_str()) );
45 TTree*
t =
f->Get<TTree>(
"mapping");
47 unsigned long long scid = 0;
48 std::pair<int,int>
coord = {0,0};
49 std::pair<int,int> slot;
50 t->SetBranchAddress(
"scid",&scid);
51 t->SetBranchAddress(
"etaIndex",&
coord.first);
52 t->SetBranchAddress(
"phiIndex",&
coord.second);
53 t->SetBranchAddress(
"slot1",&slot.first);
54 t->SetBranchAddress(
"slot2",&slot.second);
55 for(Long64_t
i=0;
i<
t->GetEntries();
i++) {
57 m_scMap[scid] = std::make_pair(
coord,slot);
61 if (m_scMap.empty()) {
68 return StatusCode::SUCCESS;
78 return StatusCode::FAILURE;
83 return StatusCode::FAILURE;
89 return StatusCode::FAILURE;
94 std::map<std::pair<int,int>,std::array<int,11>>
towers;
96 constexpr
int INVALID_VALUE = -99999;
100 for (
auto digi: *scells) {
101 const auto itr = m_scMap.find(digi->ID().get_compact());
102 if (itr == m_scMap.end()) {
continue; }
103 int val =
std::round(digi->energy()/(12.5*std::cosh(digi->eta())));
105 bool isSaturated = (!
isMC) ? (digi->quality()) :
false;
106 bool isMasked =
m_applyMasking ? ((digi)->provenance()&0x80) :
false;
107 bool isInvalid =
m_applyMasking ? ((digi)->provenance()&0x40) :
false;
113 val = SATURATED_VALUE;
116 auto towerItr =
towers.emplace(itr->second.first,std::array<int,11>{});
117 if(towerItr.second) {
118 towerItr.first->second.fill(INVALID_VALUE);
120 auto& tower = (towerItr.first->second);
121 if (itr->second.second.second<11) {
123 if (!isMasked &&
val!=INVALID_VALUE) {
126 tower.at(itr->second.second.first) = SATURATED_VALUE;
127 tower.at(itr->second.second.second) = SATURATED_VALUE;
129 if(tower.at(itr->second.second.first)!=(SATURATED_VALUE)) {
131 if (tower.at(itr->second.second.first)==MASKED_VALUE || tower.at(itr->second.second.first)==INVALID_VALUE) {
132 tower.at(itr->second.second.first)=0;
134 tower.at(itr->second.second.first) +=
val >> 1;
136 if(tower.at(itr->second.second.second)!=(SATURATED_VALUE)) {
138 if (tower.at(itr->second.second.second)==MASKED_VALUE || tower.at(itr->second.second.second)==INVALID_VALUE) {
139 tower.at(itr->second.second.second)=0;
141 tower.at(itr->second.second.second) += (
val - (
val >> 1));
148 auto&
v = tower.at(itr->second.second.first);
151 if(
v==INVALID_VALUE)
v = MASKED_VALUE;
152 }
else if(isSaturated) {
155 if(
v==INVALID_VALUE)
v = 0;
163 static const auto etaIndex = [](
float eta) {
return int( eta*10 ) + ((eta<0) ? -1 : 1); };
164 static const auto phiIndex = [](
float phi) {
return int( phi*32./
M_PI ) + (phi<0 ? -1 : 1); };
166 if (std::abs(tTower->eta()) > 1.5)
continue;
167 if (tTower->sampling() != 1)
continue;
169 auto towerItr =
towers.emplace(std::pair(etaIndex(tTower->eta()),
phiIndex(phi)),std::array<int,11>{});
170 if(towerItr.second) {
171 towerItr.first->second.fill(INVALID_VALUE);
173 (towerItr.first->second).at(10) = tTower->cpET();
178 ATH_CHECK( eTowers.
record(std::make_unique<xAOD::eFexTowerContainer>(),std::make_unique<xAOD::eFexTowerAuxContainer>()) );
180 static const auto calToFex = [](
int calEt) {
181 if(calEt == MASKED_VALUE)
return 0;
182 if(calEt == SATURATED_VALUE)
return 1023;
183 if( calEt == INVALID_VALUE )
return 1022;
184 if(calEt<448)
return std::max((calEt&~1)/2+32,1);
185 if(calEt<1472)
return (calEt-448)/4+256;
186 if(calEt<3520)
return (calEt-1472)/8+512;
187 if(calEt<11584)
return (calEt-3520)/32+768;
196 size_t ni = (std::abs(
coord.first)<=15) ? 10 : 11;
197 for(
size_t i=0;
i<ni;++
i) counts[
i] = (scells->empty() ? 1025 : calToFex(counts[
i]));
198 eTowers->
push_back( std::make_unique<xAOD::eFexTower>() );
199 eTowers->
back()->initialize( ( (
coord.first<0 ? 0.5:-0.5) +
coord.first)*0.1 ,
201 std::vector<uint16_t>(counts.begin(), counts.end()),
207 return StatusCode::SUCCESS;
211 StatusCode eFexTowerBuilder::fillMap(
const EventContext& ctx)
const {
218 ATH_MSG_FATAL(
"Could not retrieve collection " << m_scellKey.key() );
219 return StatusCode::FAILURE;
221 if (scells->
size() != 34048 && !m_mappingFile.empty()) {
222 ATH_MSG_FATAL(
"Cannot fill sc -> eFexTower mapping with an incomplete sc collection");
223 return StatusCode::FAILURE;
226 std::vector<unsigned long long> ps;
227 std::vector<std::pair<float,unsigned long long>>
l1;
228 std::vector<std::pair<float,unsigned long long>>
l2;
229 std::vector<unsigned long long> l3;
230 std::vector<unsigned long long> had;
231 std::vector<unsigned long long>
other;
233 static const auto etaIndex = [](
float eta) {
return int(
eta*10 ) + ((
eta<0) ? -1 : 1); };
234 static const auto phiIndex = [](
float phi) {
return int(
phi*32./ROOT::Math::Pi() ) + (
phi<0 ? -1 : 1); };
235 std::map<std::pair<int,int>,TowerSCells>
towers;
236 std::map<unsigned long long,int> eTowerSlots;
238 for (
auto digi: *scells) {
241 if (
auto elem = ddm->get_element(
id); elem && std::abs(elem->eta_raw())<2.5) {
242 float eta = elem->eta_raw();
243 int sampling = elem->getSampling();
244 if(sampling==6 && ddm->getCaloCell_ID()->region(
id)==0 &&
eta<0)
eta-=0.01;
246 unsigned long long val =
id.get_compact();
248 int towerid = -1;
int slot = -1;
bool issplit =
false;
249 CHECK(m_eFEXSuperCellTowerIdProviderTool->geteTowerIDandslot(
id.get_compact(), towerid, slot, issplit));
250 eTowerSlots[
id.get_compact()] = slot;
255 sc.ps.push_back(
val);
258 sc.l1.push_back({elem->eta(),
val});
break;
260 sc.l2.push_back({elem->eta(),
val});
break;
262 sc.l3.push_back(
val);
break;
263 case 8:
case 9:
case 10:
case 11:
264 sc.had.push_back(
val);
break;
266 sc.other.push_back(
val);
break;
274 std::vector<size_t> slotVector(11);
276 std::sort(
sc.l1.begin(),
sc.l1.end());
277 std::sort(
sc.l2.begin(),
sc.l2.end());
279 if (
sc.l2.size()==5) {
280 if (
coord.first >= 0) {
281 sc.l3.push_back(
sc.l2.front().second);
282 sc.l2.erase(
sc.l2.begin());
284 sc.l3.push_back(
sc.l2.back().second);
285 sc.l2.resize(
sc.l2.size()-1);
288 if (std::abs(
coord.first)==15) {
295 if (
sc.l1.size()==6) {
296 m_scMap[
sc.l1.at(0).second] = std::pair(
coord,std::pair(1,11));
297 m_scMap[
sc.l1.at(1).second] = std::pair(
coord,(m_v6Mapping &&
coord.first < 0) ? std::pair(2,1) : std::pair(1,2));
298 m_scMap[
sc.l1.at(2).second] = std::pair(
coord,std::pair(2,11));
299 m_scMap[
sc.l1.at(3).second] = std::pair(
coord,std::pair(3,11));
300 m_scMap[
sc.l1.at(4).second] = std::pair(
coord,(m_v6Mapping &&
coord.first < 0) ? std::pair(4,3) : std::pair(3,4));
301 m_scMap[
sc.l1.at(5).second] = std::pair(
coord,std::pair(4,11));
302 slotVector[1] = eTowerSlots[
sc.l1.at(0).second];
303 slotVector[2] = eTowerSlots[
sc.l1.at(2).second];
304 slotVector[3] = eTowerSlots[
sc.l1.at(3).second];
305 slotVector[4] = eTowerSlots[
sc.l1.at(5).second];
309 if (
sc.l1.size()==1) {
310 m_scMap[
sc.l1.at(0).second] = std::pair(
coord,std::pair(4,11));
311 slotVector[1] = 1; slotVector[2] = 2; slotVector[3] = 3; slotVector[4] = eTowerSlots[
sc.l1.at(0).second];
315 if (!
sc.ps.empty()) {m_scMap[
sc.ps.at(0)] = std::pair(
coord,std::pair(0,11)); slotVector[0] = eTowerSlots[
sc.ps.at(0)]; }
316 if(
sc.l1.size()==4)
for(
size_t i=0;
i<4;
i++)
if(
sc.l1.size() >
i) {m_scMap[
sc.l1.at(
i).second] = std::pair(
coord,std::pair(
i+1,11)); slotVector[
i+1] = eTowerSlots[
sc.l1.at(
i).second]; }
317 for(
size_t i=0;
i<4;
i++)
if(
sc.l2.size() >
i) { m_scMap[
sc.l2.at(
i).second] = std::pair(
coord,std::pair(
i+5,11)); slotVector[
i+5] = eTowerSlots[
sc.l2.at(
i).second]; }
318 if (!
sc.l3.empty()) {m_scMap[
sc.l3.at(0)] = std::pair(
coord,std::pair(9,11)); slotVector[9] = eTowerSlots[
sc.l3.at(0)]; }
319 if (!
sc.had.empty()) {m_scMap[
sc.had.at(0)] = std::pair(
coord,std::pair(10,11));slotVector[10] = eTowerSlots[
sc.had.at(0)]; }
333 if(!m_mappingFile.empty()) {
334 TFile
f(m_mappingFile.value().c_str(),
"RECREATE");
335 TTree *
t =
new TTree(
"mapping",
"mapping");
336 unsigned long long scid = 0;
337 std::pair<int, int>
coord = {0, 0};
338 std::pair<int, int> slot = {-1, -1};
339 t->Branch(
"scid", &scid);
340 t->Branch(
"etaIndex", &
coord.first);
341 t->Branch(
"phiIndex", &
coord.second);
342 t->Branch(
"slot1", &slot.first);
343 t->Branch(
"slot2", &slot.second);
344 for (
auto &[
id,
val]: m_scMap) {
353 return StatusCode::SUCCESS;
360 setFilterPassed(
true, ctx);
364 std::lock_guard lock(m_fillMapMutex);
365 if (m_scMap.empty())
CHECK( fillMap(ctx) );
368 return fillTowers(ctx);