|
| 1 | +// Copyright 2019-2020 CERN and copyright holders of ALICE O2. |
| 2 | +// See https://alice-o2.web.cern.ch/copyright for details of the copyright holders. |
| 3 | +// All rights not expressly granted are reserved. |
| 4 | +// |
| 5 | +// This software is distributed under the terms of the GNU General Public |
| 6 | +// License v3 (GPL Version 3), copied verbatim in the file "COPYING". |
| 7 | +// |
| 8 | +// In applying this license CERN does not waive the privileges and immunities |
| 9 | +// granted to it by virtue of its status as an Intergovernmental Organization |
| 10 | +// or submit itself to any jurisdiction. |
| 11 | + |
| 12 | +/// \file EventFinder.cxx |
| 13 | +/// \brief Implementation of a class to group MCH digits based on MID information |
| 14 | +/// |
| 15 | +/// \author Philippe Pillot, Subatech |
| 16 | + |
| 17 | +#include "MCHTriggering/EventFinder.h" |
| 18 | + |
| 19 | +#include <algorithm> |
| 20 | +#include <iterator> |
| 21 | +#include <utility> |
| 22 | + |
| 23 | +#include "CommonDataFormat/InteractionRecord.h" |
| 24 | +#include "MCHTriggering/EventFinderParam.h" |
| 25 | + |
| 26 | +namespace o2 |
| 27 | +{ |
| 28 | +namespace mch |
| 29 | +{ |
| 30 | + |
| 31 | +//_________________________________________________________________________________________________ |
| 32 | +/// run the event finder algorithm |
| 33 | +void EventFinder::run(const gsl::span<const mch::ROFRecord>& mchROFs, |
| 34 | + const gsl::span<const mch::Digit>& digits, |
| 35 | + const dataformats::MCLabelContainer* labels, |
| 36 | + const gsl::span<const mid::ROFRecord>& midROFs) |
| 37 | +{ |
| 38 | + mEvents.clear(); |
| 39 | + mROFs.clear(); |
| 40 | + mDigits.clear(); |
| 41 | + mLabels.clear(); |
| 42 | + |
| 43 | + if (mchROFs.empty() || midROFs.empty()) { |
| 44 | + return; |
| 45 | + } |
| 46 | + |
| 47 | + // create empty events ordered in increasing trigger time |
| 48 | + const auto& param = EventFinderParam::Instance(); |
| 49 | + for (const auto& midROF : midROFs) { |
| 50 | + if (midROF.nEntries == 0) { |
| 51 | + continue; |
| 52 | + } |
| 53 | + auto midBC = midROF.interactionRecord.toLong(); |
| 54 | + mEvents.emplace(std::make_pair(midBC, Event(midBC + param.triggerRange[0], midBC + param.triggerRange[1]))); |
| 55 | + } |
| 56 | + |
| 57 | + // associate each MCH ROF to the first compatible trigger, if any |
| 58 | + for (int i = 0; i < mchROFs.size(); ++i) { |
| 59 | + auto mchBC = mchROFs[i].getBCData().toLong(); |
| 60 | + auto itEvent = mEvents.lower_bound(mchBC - param.triggerRange[1] + 1); |
| 61 | + if (itEvent != mEvents.end() && itEvent->second.trgRange[0] < mchBC + mchROFs[i].getBCWidth()) { |
| 62 | + itEvent->second.iMCHROFs.push_back(i); |
| 63 | + itEvent->second.maxRORange = std::max(itEvent->second.maxRORange, mchBC + mchROFs[i].getBCWidth()); |
| 64 | + } |
| 65 | + } |
| 66 | + |
| 67 | + // merge overlapping events (when a MCH ROF is compatible with multiple trigger) and cleanup |
| 68 | + for (auto itEvent = mEvents.begin(); itEvent != mEvents.end();) { |
| 69 | + if (itEvent->second.iMCHROFs.empty()) { |
| 70 | + itEvent = mEvents.erase(itEvent); |
| 71 | + } else { |
| 72 | + auto itNextEvent = std::next(itEvent); |
| 73 | + if (itNextEvent != mEvents.end() && itNextEvent->second.trgRange[0] < itEvent->second.maxRORange) { |
| 74 | + itEvent->second.trgRange[1] = itNextEvent->second.trgRange[1]; |
| 75 | + itEvent->second.maxRORange = std::max(itEvent->second.maxRORange, itNextEvent->second.maxRORange); |
| 76 | + itEvent->second.iMCHROFs.insert(itEvent->second.iMCHROFs.end(), |
| 77 | + itNextEvent->second.iMCHROFs.begin(), itNextEvent->second.iMCHROFs.end()); |
| 78 | + mEvents.erase(itNextEvent); |
| 79 | + } else { |
| 80 | + itEvent = itNextEvent; |
| 81 | + } |
| 82 | + } |
| 83 | + } |
| 84 | + |
| 85 | + // merge digits associated to each event and produce the output ROFs pointing to them |
| 86 | + // the BC range of each ROF is set to contain only the MID IR(s) associated to the event |
| 87 | + InteractionRecord ir{}; |
| 88 | + for (const auto& event : mEvents) { |
| 89 | + mDigitLoc.clear(); |
| 90 | + int digitOffset = mDigits.size(); |
| 91 | + for (auto iMCHROF : event.second.iMCHROFs) { |
| 92 | + for (int iDigit = mchROFs[iMCHROF].getFirstIdx(); iDigit <= mchROFs[iMCHROF].getLastIdx(); ++iDigit) { |
| 93 | + const auto& digit = digits[iDigit]; |
| 94 | + auto digitLoc = mDigitLoc.emplace(((digit.getDetID() << 16) | digit.getPadID()), mDigits.size()); |
| 95 | + if (digitLoc.second) { |
| 96 | + mDigits.emplace_back(digit); |
| 97 | + if (labels != nullptr) { |
| 98 | + mLabels.addElements(digitLoc.first->second, labels->getLabels(iDigit)); |
| 99 | + } |
| 100 | + } else { |
| 101 | + auto& digit0 = mDigits[digitLoc.first->second]; |
| 102 | + digit0.setADC(digit0.getADC() + digit.getADC()); |
| 103 | + digit0.setNofSamples(digit0.getNofSamples() + digit.getNofSamples()); |
| 104 | + digit0.setSaturated(digit0.isSaturated() || digit.isSaturated()); |
| 105 | + if (labels != nullptr) { |
| 106 | + for (const auto& label : labels->getLabels(iDigit)) { |
| 107 | + mLabels.addElementRandomAccess(digitLoc.first->second, label); |
| 108 | + } |
| 109 | + } |
| 110 | + } |
| 111 | + } |
| 112 | + } |
| 113 | + ir.setFromLong(event.first); |
| 114 | + mROFs.emplace_back(ir, digitOffset, mDigits.size() - digitOffset, |
| 115 | + event.second.trgRange[1] - param.triggerRange[1] - event.first + 1); |
| 116 | + } |
| 117 | +} |
| 118 | + |
| 119 | +} // namespace mch |
| 120 | +} // namespace o2 |
0 commit comments