49 ATH_MSG_FATAL(
"Both usePixelSpacePoints and useSctSpacePoints set to False. At least one needs to be True");
50 return StatusCode::FAILURE;
65 return StatusCode::SUCCESS;
81 float shift_x =
vertex.x() - beamSpotHandle->beamTilt(0)*
vertex.z();
82 float shift_y =
vertex.y() - beamSpotHandle->beamTilt(1)*
vertex.z();
84 std::unique_ptr<GNN_DataStorage> storage = std::make_unique<GNN_DataStorage>(*
m_geo,
m_mlLUT);
92 std::map<short, std::vector<IdentifierHash> > detIdMap;
104 sctSpacePointsContainer = sctHandle.
ptr();
106 std::vector<IdentifierHash> listOfSctIds;
107 m_regsel_sct->lookup(ctx)->HashIDList( internalRoI, listOfSctIds );
111 for(
const auto& hashId : listOfSctIds) {
113 short layerIndex = h2l->at(
static_cast<int>(hashId));
115 auto it = detIdMap.find(layerIndex);
116 if(
it != detIdMap.end()) (*it).second.push_back(hashId);
118 std::vector<IdentifierHash>
v = {hashId};
119 detIdMap.insert(std::make_pair(layerIndex,
v));
133 pixelSpacePointsContainer = pixHandle.
ptr();
135 std::vector<IdentifierHash> listOfPixIds;
137 m_regsel_pix->lookup(ctx)->HashIDList( internalRoI, listOfPixIds );
141 for(
const auto& hashId : listOfPixIds) {
143 short layerIndex = h2l->at(
static_cast<int>(hashId));
145 auto it = detIdMap.find(layerIndex);
146 if(
it != detIdMap.end()) (*it).second.push_back(hashId);
148 std::vector<IdentifierHash>
v = {hashId};
149 detIdMap.insert(std::make_pair(layerIndex,
v));
156 std::unique_ptr<GNN_DataStorage> storage = std::make_unique<GNN_DataStorage>(*
m_geo,
m_mlLUT);
158 std::vector<const Trk::SpacePoint*> vSP;
162 std::vector<std::vector<GNN_Node> > trigSpStorage[2];
168 for(
const auto& lColl : detIdMap) {
170 short layerIndex = lColl.first;
172 int layerKey =
m_geo->getTrigFTF_GNN_LayerByIndex(layerIndex)->m_layer.m_subdet;
174 bool isPixel = layerKey > 20000;
176 auto pCont = isPixel ? pixelSpacePointsContainer : sctSpacePointsContainer;
178 int contIdx= isPixel ? 0 : 1;
182 for(
const auto&
idx : lColl.second) {
184 std::vector<GNN_Node>& tmpColl = trigSpStorage[contIdx].at(
static_cast<int>(
idx));
186 auto input_coll = pCont->indexFindPtr(
idx);
188 if(input_coll ==
nullptr)
continue;
195 if(isPixel) nPixels += nNewNodes;
206 std::vector<GNN_Edge> edgeStorage;
208 std::pair<int, int> graphStats =
buildTheGraph(internalRoI, storage, edgeStorage);
210 ATH_MSG_DEBUG(
"Created graph with "<<graphStats.first<<
" edges and "<<graphStats.second<<
" edge links");
215 if (graphStats.second == 0)
return seedStats;
217 int maxLevel =
runCCA(graphStats.first, edgeStorage);
219 ATH_MSG_DEBUG(
"Reached Level "<<maxLevel<<
" after GNN iterations");
221 std::vector<std::tuple<float, int, std::vector<unsigned int> > > vSeedCandidates;
225 if (vSeedCandidates.empty())
return seedStats;
227 for(
const auto& seed : vSeedCandidates) {
229 if (std::get<1>(seed) != 0)
continue;
231 unsigned int lastIdx =
output.size();
232 output.emplace_back(std::get<0>(seed));
234 for(
const auto& sp_idx : std::get<2>(seed)) {
235 output[lastIdx].addSpacePoint(vSP[sp_idx]);
244 std::vector<const Trk::SpacePoint*> vSP;
245 std::vector<short> vL;
247 vSP.reserve(TrigAccel::ITk::GBTS_MAX_NUMBER_SPACEPOINTS);
248 vL.reserve(TrigAccel::ITk::GBTS_MAX_NUMBER_SPACEPOINTS);
250 std::unique_ptr<TrigAccel::DATA_EXPORT_BUFFER> dataBuffer = std::unique_ptr<TrigAccel::DATA_EXPORT_BUFFER>(
new TrigAccel::DATA_EXPORT_BUFFER(5000));
253 const size_t bufferOffset = 256;
254 size_t totalSize = bufferOffset+dataTypeSize;
259 unsigned int spIdx = 0;
265 for(
const auto& lColl : detIdMap) {
267 short layerIndex = lColl.first;
273 bool isPixel = layerKey > 20000;
276 auto pCont = isPixel ? pixelSpacePointsContainer : sctSpacePointsContainer;
290 if(
b > MaxEtaBin) MaxEtaBin =
b;
293 for(
const auto&
idx : lColl.second) {
295 auto input_coll = pCont->indexFindPtr(
idx);
297 if(input_coll ==
nullptr)
continue;
299 for(
const auto sp : *input_coll) {
307 if(cw > 0.2)
continue;
312 vSP.emplace_back(sp);
313 vL.emplace_back(layerIndex);
315 const auto&
p = sp->globalPosition();
317 float params[4] = {(
float)(
p.x() - shift_x),
float(
p.y() - shift_y), (
float)(
p.z()), cw};
323 if(spIdx >= TrigAccel::ITk::GBTS_MAX_NUMBER_SPACEPOINTS)
break;
325 if(spIdx >= TrigAccel::ITk::GBTS_MAX_NUMBER_SPACEPOINTS)
break;
330 if (isPixel) nPixels += spIdx - pJobData->
m_layerInfo[4*nLayers];
336 if(spIdx == 0)
return seedStats;
342 pJobData->
m_nMaxEdges =
static_cast<unsigned int>(7*spIdx);
348 for(
const auto&
bg :
m_geo->bin_groups()) {
350 int bin1_idx =
bg.first;
352 for(
const auto& bin2_idx :
bg.second) {
363 const float ptCoeff = 0.29997*1.9972/2.0;
365 float tripletPtMin = 0.8*
m_minPt;
367 float maxCurv = ptCoeff/tripletPtMin;
369 const float pt_scale = 900/
m_minPt;
371 const float min_deltaPhi_low_dr = 0.002*pt_scale;
372 const float dphi_coeff_low_dr = 4.33e-4*pt_scale;
373 const float min_deltaPhi = 0.015*pt_scale;
374 const float dphi_coeff = 2.2e-4*pt_scale;
376 const float cut_dphi_max =
m_LRTmode ? 0.07 : 0.012;
377 const float cut_dcurv_max =
m_LRTmode ? 0.015 : 0.001;
378 const float cut_tau_ratio_max =
m_LRTmode ? 0.015f : 0.01;
382 const float maxOuterRadius =
m_LRTmode ? 1050.0 : 550.0;
383 const float minDeltaRadius = 2.0;
385 const float cut_zMinU = min_z0 + maxOuterRadius*internalRoI.
dzdrMinus();
386 const float cut_zMaxU = max_z0 + maxOuterRadius*internalRoI.
dzdrPlus();
388 const float maxKappa =
m_LRTmode ? 1.0*maxCurv : 0.9*maxCurv;
420 std::shared_ptr<TrigAccel::OffloadBuffer> pBuff = std::make_shared<TrigAccel::OffloadBuffer>(dataBuffer.get());
429 bool workSuccess = pWork->
run();
435 std::shared_ptr<TrigAccel::OffloadBuffer> pOutput = pWork->
getOutput();
442 if(pSeeds->
m_nSeeds == 0)
return seedStats;
444 for(
unsigned int seed=0; seed<pSeeds->
m_nSeeds; seed++) {
446 unsigned int lastIdx =
output.size();
455 unsigned int nEdges = pGraph->
m_nEdges;
460 std::vector<GNN_Node> nodes;
462 nodes.reserve(vSP.size());
464 for(
unsigned int idx = 0;
idx < vSP.size();
idx++) {
466 nodes.emplace_back(vL[
idx]);
468 const auto&
pos = vSP[
idx]->globalPosition();
469 float xs =
pos.x() - shift_x;
470 float ys =
pos.y() - shift_y;
476 nodes[
idx].m_r = std::sqrt(xs*xs + ys*ys);
482 std::vector<GNN_Edge> edgeStorage;
484 std::pair<int, int> graphStats(0,0);
486 edgeStorage.resize(nEdges);
488 unsigned int edgeSize = nMaxNei + 1 + 2;
490 for(
unsigned int idx=0;
idx<nEdges;
idx++) {
491 unsigned int pos =
idx*edgeSize;
499 edgeStorage[
idx].m_n1 = &nodes[node1Idx];
500 edgeStorage[
idx].m_n2 = &nodes[node2Idx];
501 edgeStorage[
idx].m_level = 1;
502 edgeStorage[
idx].m_nNei = nNei;
503 for(
int k=0;
k<nNei;
k++) {
508 graphStats.first = nEdges;
509 graphStats.second = pGraph->
m_nLinks;
513 int maxLevel =
runCCA(graphStats.first, edgeStorage);
515 ATH_MSG_DEBUG(
"Reached Level "<<maxLevel<<
" after GNN iterations");
517 if(maxLevel < minLevel)
return seedStats;
519 std::vector<GNN_Edge*> vSeeds;
521 vSeeds.reserve(graphStats.first/2);
523 for(
int edgeIndex=0;edgeIndex<graphStats.first;edgeIndex++) {
524 GNN_Edge* pS = &(edgeStorage.at(edgeIndex));
526 if(pS->
m_level < minLevel)
continue;
528 vSeeds.push_back(pS);
531 if(vSeeds.empty())
return seedStats;
539 output.reserve(vSeeds.size());
541 for(
auto pS : vSeeds) {
543 if(pS->m_level == -1)
continue;
553 if(
static_cast<int>(rs.
m_vs.size()) < minLevel)
continue;
555 std::vector<const GNN_Node*> vN;
557 for(std::vector<GNN_Edge*>::reverse_iterator sIt=rs.
m_vs.rbegin();sIt!=rs.
m_vs.rend();++sIt) {
559 (*sIt)->m_level = -1;
561 if(sIt == rs.
m_vs.rbegin()) {
562 vN.push_back((*sIt)->m_n1);
564 vN.push_back((*sIt)->m_n2);
567 if(vN.size()<3)
continue;
569 unsigned int lastIdx =
output.size();
572 for(
const auto&
n : vN) {
573 output[lastIdx].addSpacePoint(vSP[
n->m_idx]);
587 int init_size = vSP.size();
588 for(
const auto sp : *spColl) {
589 const auto&
pos = sp->globalPosition();
590 vSP.emplace_back(sp);
591 float xs =
pos.x() - shift_x;
592 float ys =
pos.y() - shift_y;
594 tmpColl[
idx].m_x = xs;
595 tmpColl[
idx].m_y = ys;
596 tmpColl[
idx].m_z = zs;
597 tmpColl[
idx].m_r = std::sqrt(xs*xs + ys*ys);
598 tmpColl[
idx].m_phi = std::atan2(ys,xs);
599 tmpColl[
idx].m_idx = init_size +
idx;