FWIO/RNTupleTempInput/src/ProvenanceAdaptor.cc - master - githubmirror/cmssw

FWIO/RNTupleTempInput/src/ProvenanceAdaptor.cc
192 строки8 KB
Christopher Jones
All RNTupleTemp related files
03 дек 2025, 00:03
03 дек 2025, 00:03fd9ee5f
/*----------------------------------------------------------------------

ProvenanceAdaptor.cc

----------------------------------------------------------------------*/
//------------------------------------------------------------
// Class ProvenanceAdaptor: adapts old provenance (fileFormatVersion_.value() < 11) to new provenance.

#include "ProvenanceAdaptor.h"

#include <cassert>
#include <memory>

#include <set>
#include <utility>
#include <string>
#include <memory>
#include "DataFormats/Provenance/interface/BranchID.h"
#include "DataFormats/Provenance/interface/ProcessConfiguration.h"
#include "DataFormats/Provenance/interface/ProcessHistory.h"
#include "DataFormats/Provenance/interface/ProductRegistry.h"
#include "FWCore/Utilities/interface/Algorithms.h"
namespace edm::rntuple_temp {

  void ProvenanceAdaptor::fixProcessHistory(ProcessHistoryMap& pHistMap, ProcessHistoryVector& pHistVector) {
    assert(pHistMap.empty() != pHistVector.empty());
    for (ProcessHistoryVector::const_iterator i = pHistVector.begin(), e = pHistVector.end(); i != e; ++i) {
      pHistMap.insert(std::make_pair(i->id(), *i));
    }
    pHistVector.clear();
    for (ProcessHistoryMap::const_iterator i = pHistMap.begin(), e = pHistMap.end(); i != e; ++i) {
      ProcessHistory newHist;
      ProcessHistoryID const& oldphID = i->first;
      for (ProcessHistory::const_iterator it = i->second.begin(), et = i->second.end(); it != et; ++it) {
        ParameterSetID const& newPsetID = convertID(it->parameterSetID());
        newHist.emplace_back(it->processName(), newPsetID, it->releaseVersion(), it->hardwareResourcesDescription());
      }
      assert(newHist.size() == i->second.size());
      ProcessHistoryID newphID = newHist.id();
      pHistVector.push_back(std::move(newHist));
      if (newphID != oldphID) {
        processHistoryIdConverter_.insert(std::make_pair(oldphID, newphID));
      }
    }
    assert(pHistVector.size() == pHistMap.size());
  }

  namespace {
    typedef StringVector OneHistory;
    typedef std::set<OneHistory> Histories;
    typedef std::pair<std::string, BranchID> Product;
    typedef std::vector<Product> OrderedProducts;
    struct Sorter {
      explicit Sorter(Histories const& histories) : histories_(histories) {}
      bool operator()(Product const& a, Product const& b) const;
      Histories const histories_;
    };
    bool Sorter::operator()(Product const& a, Product const& b) const {
      assert(a != b);
      if (a.first == b.first)
        return false;
      bool mayBeTrue = false;
      for (Histories::const_iterator it = histories_.begin(), itEnd = histories_.end(); it != itEnd; ++it) {
        OneHistory::const_iterator itA = find_in_all(*it, a.first);
        if (itA == it->end())
          continue;
        OneHistory::const_iterator itB = find_in_all(*it, b.first);
        if (itB == it->end())
          continue;
        assert(itA != itB);
        if (itB < itA) {
          // process b precedes process a;
          return false;
        }
        // process a precedes process b;
        mayBeTrue = true;
      }
      return mayBeTrue;
    }

    void fillProcessConfiguration(ProcessHistoryVector const& pHistVec, ProcessConfigurationVector& procConfigVector) {
      procConfigVector.clear();
      std::set<ProcessConfiguration> pcset;
      for (auto const& history : pHistVec) {
        for (auto const& process : history) {
          if (pcset.insert(process).second) {
            procConfigVector.push_back(process);
          }
        }
      }
    }

    void fillListsAndIndexes(ProductRegistry& productRegistry,
                             ProcessHistoryMap const& pHistMap,
                             std::shared_ptr<BranchIDLists>& branchIDLists,
                             std::vector<BranchListIndex>& branchListIndexes) {
      OrderedProducts orderedProducts;
      std::set<std::string> processNamesThatProduced;
      ProductRegistry::ProductList& prodList = productRegistry.productListUpdator();
      for (auto& item : prodList) {
        ProductDescription& prod = item.second;
        if (prod.branchType() == InEvent) {
          prod.init();
          processNamesThatProduced.insert(prod.processName());
          orderedProducts.emplace_back(prod.processName(), prod.branchID());
        }
      }
      assert(!orderedProducts.empty());
      Histories processHistories;
      size_t max = 0;
      for (ProcessHistoryMap::const_iterator it = pHistMap.begin(), itEnd = pHistMap.end(); it != itEnd; ++it) {
        ProcessHistory const& pHist = it->second;
        OneHistory processHistory;
        for (ProcessHistory::const_iterator i = pHist.begin(), iEnd = pHist.end(); i != iEnd; ++i) {
          if (processNamesThatProduced.find(i->processName()) != processNamesThatProduced.end()) {
            processHistory.push_back(i->processName());
          }
        }
        max = (processHistory.size() > max ? processHistory.size() : max);
        assert(max <= processNamesThatProduced.size());
        if (processHistory.size() > 1) {
          processHistories.insert(processHistory);
        }
      }
      stable_sort_all(orderedProducts, Sorter(processHistories));

      auto pv = std::make_unique<BranchIDLists>();
      auto p = std::make_unique<BranchIDList>();
      std::string processName;
      BranchListIndex blix = 0;
      for (OrderedProducts::const_iterator it = orderedProducts.begin(), itEnd = orderedProducts.end(); it != itEnd;
           ++it) {
        if (it->first != processName) {
          if (!processName.empty()) {
            branchListIndexes.push_back(blix);
            ++blix;
            pv->push_back(std::move(*p));
            p = std::make_unique<BranchIDList>();
          }
          processName = it->first;
        }
        p->push_back(it->second.id());
      }
      branchListIndexes.push_back(blix);
      pv->push_back(std::move(*p));
      branchIDLists.reset(pv.release());
    }
  }  // namespace

  ProvenanceAdaptor::ProvenanceAdaptor(ProductRegistry& productRegistry,
                                       ProcessHistoryMap& pHistMap,
                                       ProcessHistoryVector& pHistVector,
                                       ProcessConfigurationVector& procConfigVector,
                                       ParameterSetIdConverter const& parameterSetIdConverter,
                                       bool fullConversion)
      : parameterSetIdConverter_(parameterSetIdConverter),
        processHistoryIdConverter_(),
        branchIDLists_(),
        branchListIndexes_() {
    fixProcessHistory(pHistMap, pHistVector);
    fillProcessConfiguration(pHistVector, procConfigVector);
    if (fullConversion) {
      fillListsAndIndexes(productRegistry, pHistMap, branchIDLists_, branchListIndexes_);
    }
  }

  ProvenanceAdaptor::~ProvenanceAdaptor() {}

  ParameterSetID const& ProvenanceAdaptor::convertID(ParameterSetID const& oldID) const {
    ParameterSetIdConverter::const_iterator it = parameterSetIdConverter_.find(oldID);
    if (it == parameterSetIdConverter_.end()) {
      return oldID;
    }
    return it->second;
  }

  ProcessHistoryID const& ProvenanceAdaptor::convertID(ProcessHistoryID const& oldID) const {
    ProcessHistoryIdConverter::const_iterator it = processHistoryIdConverter_.find(oldID);
    if (it == processHistoryIdConverter_.end()) {
      return oldID;
    }
    return it->second;
  }

  std::shared_ptr<BranchIDLists> ProvenanceAdaptor::releaseBranchIDLists() {
    auto ptr = branchIDLists_;
    branchIDLists_.reset();
    return ptr;
  }

  void ProvenanceAdaptor::branchListIndexes(BranchListIndexes& indexes) const { indexes = branchListIndexes_; }
}  // namespace edm::rntuple_temp