Line Code
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182

#include "DataFormats/Common/interface/HLTenums.h"
#include "DataFormats/HLTReco/interface/HLTPerformanceInfo.h"
#include <algorithm>

HLTPerformanceInfo::HLTPerformanceInfo() {
  paths_.clear();
  modules_.clear();
}

HLTPerformanceInfo::PathList::iterator HLTPerformanceInfo::findPath(const char* pathName) {
  PathList::iterator l = std::find(paths_.begin(), paths_.end(), pathName);
  return l;
}

HLTPerformanceInfo::Modules::iterator HLTPerformanceInfo::findModule(const char* moduleInstanceName) {
  return std::find(modules_.begin(), modules_.end(), moduleInstanceName);
}

double HLTPerformanceInfo::totalTime() const {
  double t = 0;
  for (size_t i = 0; i < modules_.size(); ++i) {
    t += modules_[i].time();
  }
  return t;
}

double HLTPerformanceInfo::totalCPUTime() const {
  double t = 0;
  for (size_t i = 0; i < modules_.size(); ++i) {
    t += modules_[i].cputime();
  }
  return t;
}

double HLTPerformanceInfo::totalPathTime(const size_t pathnumber) {
  double t = 0;
  unsigned int cnt = 0;
  ModulesInPath::const_iterator i = paths_[pathnumber].begin();
  for (; i != paths_[pathnumber].end(); ++i) {
    if (cnt > paths_[pathnumber].status().index())
      break;
    ++cnt;
    t += modules_[*i].time();
  }
  return t;
}

double HLTPerformanceInfo::totalPathCPUTime(const size_t pathnumber) {
  double t = 0;
  unsigned int cnt = 0;
  ModulesInPath::const_iterator i = paths_[pathnumber].begin();
  for (; i != paths_[pathnumber].end(); ++i) {
    if (cnt > paths_[pathnumber].status().index())
      break;
    ++cnt;
    t += modules_[*i].cputime();
  }
  return t;
}

double HLTPerformanceInfo::longestModuleTime() const {
  double t = -1;
  for (Modules::const_iterator i = modules_.begin(); i != modules_.end(); ++i) {
    t = std::max(i->time(), t);
  }
  return t;
}

double HLTPerformanceInfo::longestModuleCPUTime() const {
  double t = -1;
  for (Modules::const_iterator i = modules_.begin(); i != modules_.end(); ++i) {
    t = std::max(i->cputime(), t);
  }
  return t;
}

std::string HLTPerformanceInfo::longestModuleTimeName() const {
  double t = -1;
  std::string slowpoke("unknown");
  for (Modules::const_iterator i = modules_.begin(); i != modules_.end(); ++i) {
    if (i->time() > t) {
      slowpoke = i->name();
      t = i->time();
    }
  }
  return slowpoke;
}

std::string HLTPerformanceInfo::longestModuleCPUTimeName() const {
  double t = -1;
  std::string slowpoke("unknown");
  for (Modules::const_iterator i = modules_.begin(); i != modules_.end(); ++i) {
    if (i->cputime() > t) {
      slowpoke = i->name();
      t = i->cputime();
    }
  }
  return slowpoke;
}

// I think we can no longer do this as it requires going from path -> modules
// int HLTPerformanceInfo::Module::indexInPath(Path path) const
// {
//   int ctr = 0 ;
//   ModulesInPath::const_iterator iter = path.begin();
//   for ( ; iter != path.end(); ++iter ) {
//     if (modules_[*iter].name() == this->name()) return ctr ;
//     ctr++ ;
//   }
//   //--- Module not found in path ---
//   return -1 ;
// }

const HLTPerformanceInfo::Module& HLTPerformanceInfo::getModuleOnPath(size_t m, size_t p) const {
  // well if this doesn't get your attention....
  assert(p < paths_.size() && m < paths_[p].numberOfModules());
  size_t j = paths_[p].getModuleIndex(m);
  return modules_.at(j);
}

bool HLTPerformanceInfo::uniqueModule(const char* mod) const {
  int mCtr = 0;
  for (size_t p = 0; p < paths_.size(); ++p) {
    for (size_t m = 0; m < paths_[p].numberOfModules(); ++m) {
      size_t modIndex = paths_[p].getModuleIndex(m);
      if (modules_[modIndex].name() == std::string(mod))
        ++mCtr;
      if (mCtr > 1)
        return false;
    }
  }

  if (mCtr == 0)
    return false;
  return true;
}

int HLTPerformanceInfo::moduleIndexInPath(const char* mod, const char* path) {
  PathList::iterator p = findPath(path);
  if (p == endPaths())
    return -1;  // Path doesn't exist
  int ctr = 0;
  for (ModulesInPath::const_iterator j = p->begin(); j != p->end(); ++j) {
    if (modules_.at(*j) == mod)
      return ctr;
    ctr++;
  }
  return -2;  // module not found on path
}

// Set the status of the module based on the path's status
// make sure not to wipe out ones that come after the last
// module run on the particular path
void HLTPerformanceInfo::setStatusOfModulesFromPath(const char* pathName) {
  PathList::iterator p = findPath(pathName);
  if (p == endPaths()) {
    return;  // do nothing
  }
  unsigned int ctr = 0;
  for (ModulesInPath::const_iterator j = p->begin(); j != p->end(); ++j) {
    edm::hlt::HLTState modState = edm::hlt::Ready;
    unsigned int modIndex = 0;

    // get module in the master list
    Module& mod = modules_.at(*j);

    if (!mod.status().wasrun()) {
      if (p->status().accept()) {
        modState = edm::hlt::Pass;
      } else {
        if (p->status().index() > ctr) {
          modState = edm::hlt::Pass;
        } else if (p->status().index() == ctr) {
          modState = p->status().state();
        }
      }
      mod.setStatus(edm::HLTPathStatus(modState, modIndex));
    }
    ctr++;
  }
}