edm::DuplicateTreeSentry Class Reference

Classes
struct	CloseBeforeDelete

Public Member Functions
	DuplicateTreeSentry (TTree *tree)
TTree *	tree () const

Private Member Functions
void	dup ()
	DuplicateTreeSentry (DuplicateTreeSentry const &)=delete
DuplicateTreeSentry &	operator= (DuplicateTreeSentry const &)=delete

Private Attributes
std::unique_ptr< TFile, CloseBeforeDelete >	file_
std::unique_ptr< TTree >	mytree_ = nullptr
TTree *	tree_ = nullptr

Detailed Description

Currently, ROOT doesn't use any latency-hiding optimizations for fast-cloning. This causes a significant slowdown when doing fast-cloning over a high-latency network (30ms latency makes this multiple factors slower).

Accordingly, we allow sites to provide a separate hint on how to treat fast- cloning. The DuplicateTreeSentry allows us to implement it - given a tree we are about to clone, with the appropriate configs, this will re-open the file with lazy-download and re-open the tree. The new tree is appropriate for cloning. When the object is destroyed, the new file and tree are cleaned up.

Definition at line 41 of file RootOutputTree.cc.

Constructor & Destructor Documentation

DuplicateTreeSentry() [1/2]

edm::DuplicateTreeSentry::DuplicateTreeSentry ( TTree *  tree )

inline

Definition at line 43 of file RootOutputTree.cc.

: tree_(tree) { dup(); }

References dup().

DuplicateTreeSentry() [2/2]

edm::DuplicateTreeSentry::DuplicateTreeSentry ( DuplicateTreeSentry const &  )

privatedelete

Member Function Documentation

dup()

void edm::DuplicateTreeSentry::dup ( )

inlineprivate

Definition at line 59 of file RootOutputTree.cc.

               {
      edm::Service<edm::SiteLocalConfig> pSLC;
      if (!pSLC.isAvailable()) {
        return;
      }
      if (pSLC->sourceCacheHint() && *(pSLC->sourceCacheHint()) == "lazy-download") {
        return;
      }
      if (!pSLC->sourceCloneCacheHint() || *(pSLC->sourceCloneCacheHint()) != "lazy-download") {
        return;
      }
      edm::LogWarning("DuplicateTreeSentry") << "Re-opening file for fast-cloning";
 
      TFile* file = tree_->GetCurrentFile();
      const TUrl* url = file->GetEndpointUrl();
      if (!url) {
        return;
      }
      file_.reset(TFile::Open(url->GetUrl(), "READWRAP"));  // May throw an exception.
      if (!file_) {
        return;
      }
      mytree_.reset(dynamic_cast<TTree*>(file_->Get(tree_->GetName())));
      if (!mytree_) {
        return;
      }
    }

References FrontierConditions_GlobalTag_cff::file, file_, edm::Service< T >::isAvailable(), mytree_, edm::SiteLocalConfig::sourceCacheHint(), edm::SiteLocalConfig::sourceCloneCacheHint(), tree_, and relmon_authenticated_wget::url.

Referenced by DuplicateTreeSentry().

operator=()

DuplicateTreeSentry& edm::DuplicateTreeSentry::operator= ( DuplicateTreeSentry const &  )

privatedelete

tree()

TTree* edm::DuplicateTreeSentry::tree ( ) const

inline

Definition at line 45 of file RootOutputTree.cc.

{ return mytree_ ? mytree_.get() : tree_; }

References mytree_, and tree_.

Referenced by ZJetsTreeAnalyzer.ZJetsTreeAnalyzer::beginLoop(), MetTreeProducer.MetTreeProducer::declareVariables(), core.AutoFillTreeProducer.AutoFillTreeProducer::declareVariables(), edm::RootOutputTree::fastCloneTTree(), core.AutoFillTreeProducer.AutoFillTreeProducer::fillTree(), ZJetsTreeAnalyzer.ZJetsTreeAnalyzer::process(), MetTreeProducer.MetTreeProducer::process(), and python.cmstools.EventTree::SetAlias().

Member Data Documentation

file_

std::unique_ptr<TFile, CloseBeforeDelete> edm::DuplicateTreeSentry::file_

private

Note this relies on the implicit delete ordering - mytree_ (if non-null) must be deleted before file_. Do not reorder the class members!

Definition at line 91 of file RootOutputTree.cc.

Referenced by dup().

mytree_

std::unique_ptr<TTree> edm::DuplicateTreeSentry::mytree_ = nullptr

private

Definition at line 93 of file RootOutputTree.cc.

Referenced by dup(), and tree().

tree_

TTree* edm::DuplicateTreeSentry::tree_ = nullptr

private

Definition at line 92 of file RootOutputTree.cc.

Referenced by dup(), and tree().