Path.cc

Go to the documentation of this file.

#include "art/Framework/Core/Path.h"
// vim: set sw=2 expandtab :

#include "art/Framework/Core/WorkerInPath.h"
#include "art/Framework/Principal/Actions.h"
#include "art/Framework/Principal/Worker.h"
#include "art/Framework/Principal/fwd.h"
#include "art/Framework/Services/Registry/ActivityRegistry.h"
#include "art/Framework/Services/Registry/ServiceHandle.h"
#include "art/Framework/Services/System/TriggerNamesService.h"
#include "art/Utilities/GlobalTaskGroup.h"
#include "art/Utilities/Globals.h"
#include "art/Utilities/ScheduleID.h"
#include "art/Utilities/TaskDebugMacros.h"
#include "art/Utilities/Transition.h"
#include "canvas/Persistency/Common/HLTGlobalStatus.h"
#include "canvas/Persistency/Common/HLTPathStatus.h"
#include "canvas/Persistency/Common/HLTenums.h"
#include "hep_concurrency/WaitingTask.h"
#include "messagefacility/MessageLogger/MessageLogger.h"

#include <cstddef>
#include <exception>
#include <string>
#include <vector>

using namespace hep::concurrency;
using namespace std;

namespace art {

  Path::Path(ActionTable const& actions,
             ActivityRegistry const& actReg,
             PathContext const& pc,
             vector<WorkerInPath>&& workers,
             HLTGlobalStatus* pathResults,
             GlobalTaskGroup& taskGroup) noexcept
    : actionTable_{actions}
    , actReg_{actReg}
    , pc_{pc}
    , pathPosition_{ServiceHandle<TriggerNamesService>()->index_for(
        pc_.pathID())}
    , workers_{std::move(workers)}
    , trptr_{pathResults}
    , taskGroup_{taskGroup}
  {
    TDEBUG_FUNC_SI(4, pc_.scheduleID()) << hex << this << dec;
  }

  ScheduleID
  Path::scheduleID() const
  {
    return pc_.scheduleID();
  }

  PathSpec const&
  Path::pathSpec() const
  {
    return pc_.pathSpec();
  }

  PathID
  Path::pathID() const
  {
    return pc_.pathID();
  }

  string const&
  Path::name() const
  {
    return pc_.pathName();
  }

  size_t
  Path::timesRun() const
  {
    return timesRun_;
  }

  size_t
  Path::timesPassed() const
  {
    return timesPassed_;
  }

  size_t
  Path::timesFailed() const
  {
    return timesFailed_;
  }

  size_t
  Path::timesExcept() const
  {
    return timesExcept_;
  }

  hlt::HLTState
  Path::state() const
  {
    return state_;
  }

  vector<WorkerInPath> const&
  Path::workersInPath() const
  {
    return workers_;
  }

  void
  Path::process(Transition const trans, Principal& principal)
  {
    // Invoke pre-path signals only for the first schedule.
    if (pc_.scheduleID() == ScheduleID::first()) {
      switch (trans) {
      case Transition::BeginRun:
        actReg_.sPrePathBeginRun.invoke(name());
        break;
      case Transition::EndRun:
        actReg_.sPrePathEndRun.invoke(name());
        break;
      case Transition::BeginSubRun:
        actReg_.sPrePathBeginSubRun.invoke(name());
        break;
      case Transition::EndSubRun:
        actReg_.sPrePathEndSubRun.invoke(name());
        break;
      default: {
      } // No other pre-path signals supported.
      }
    }
    state_ = hlt::Ready;
    std::size_t idx = 0;
    bool all_passed{false};
    for (WorkerInPath& wip : workers_) {
      // We do not want to call (e.g.) beginRun once per schedule for
      // non-replicated modules.
      if (not wip.getWorker()->isUnique()) {
        continue;
      }
      try {
        all_passed = wip.run(trans, principal);
        if (!all_passed)
          break;
      }
      catch (cet::exception& e) {
        state_ = hlt::Exception;
        throw Exception{
          errors::ScheduleExecutionFailure, "Path: ProcessingStopped.", e}
          << "Exception going through path " << name() << '\n';
      }
      catch (...) {
        mf::LogError("PassingThrough")
          << "Exception passing through path " << name();
        state_ = hlt::Exception;
        throw;
      }
      ++idx;
    }
    if (all_passed) {
      state_ = hlt::Pass;
    } else {
      state_ = hlt::Fail;
    }
    // Invoke post-path signals only for the last schedule.
    if (pc_.scheduleID().id() == Globals::instance()->nschedules() - 1) {
      HLTPathStatus const status(state_, idx);
      switch (trans) {
      case Transition::BeginRun:
        actReg_.sPostPathBeginRun.invoke(name(), status);
        break;
      case Transition::EndRun:
        actReg_.sPostPathEndRun.invoke(name(), status);
        break;
      case Transition::BeginSubRun:
        actReg_.sPostPathBeginSubRun.invoke(name(), status);
        break;
      case Transition::EndSubRun:
        actReg_.sPostPathEndSubRun.invoke(name(), status);
        break;
      default: {
      } // No other post-path signals supported.
      }
    }
  }

  void
  Path::process(WaitingTaskPtr pathsDoneTask, EventPrincipal& ep)
  {
    // We come here as part of the readAndProcessEvent task (schedule
    // head task), or as part of the endPath task.
    auto const sid = pc_.scheduleID();
    TDEBUG_BEGIN_FUNC_SI(4, sid);
    TDEBUG_FUNC_SI(6, sid) << hex << this << dec << " Resetting waitingTasks_";

    // Make sure the list is not auto-spawning tasks.
    actReg_.sPreProcessPath.invoke(pc_);
    ++timesRun_;
    state_ = hlt::Ready;
    size_t idx = 0;
    auto max_idx = workers_.size();
    // Start the task spawn chain going with the first worker on the
    // path.  Each worker will spawn the next worker in order, until
    // all the workers have run.
    process_event_idx_asynch(idx, max_idx, ep, pathsDoneTask);
    TDEBUG_END_FUNC_SI(4, sid);
  }

  void
  Path::runWorkerTask(size_t const idx,
                      size_t const max_idx,
                      EventPrincipal& ep,
                      WaitingTaskPtr pathsDone)
  {
    auto const sid = pc_.scheduleID();
    TDEBUG_BEGIN_TASK_SI(4, sid);
    try {
      process_event_idx(idx, max_idx, ep, pathsDone);
      TDEBUG_END_TASK_SI(4, sid);
    }
    catch (...) {
      taskGroup_.may_run(pathsDone, current_exception());
      TDEBUG_END_TASK_SI(4, sid) << "path terminate because of EXCEPTION";
    }
  }

  // This function is a spawn chain system to run workers one at a time,
  // in the order specified on the path, and then decrement the ref count
  // on the endPathsTask when finished (which causes it to run if we are
  // the last path to finish running its workers).
  void
  Path::process_event_idx_asynch(size_t const idx,
                                 size_t const max_idx,
                                 EventPrincipal& ep,
                                 WaitingTaskPtr pathsDone)
  {
    auto const sid = pc_.scheduleID();
    TDEBUG_BEGIN_FUNC_SI(4, sid) << "idx: " << idx << " max_idx: " << max_idx;
    taskGroup_.run([this, idx, max_idx, &ep, pathsDone] {
      runWorkerTask(idx, max_idx, ep, pathsDone);
    });
    TDEBUG_END_FUNC_SI(4, sid) << "idx: " << idx << " max_idx: " << max_idx;
  }

  class Path::WorkerDoneTask {
  public:
    WorkerDoneTask(Path* path,
                   size_t const idx,
                   size_t const max_idx,
                   EventPrincipal& ep,
                   WaitingTaskPtr pathsDone,
                   GlobalTaskGroup& group)
      : path_{path}
      , idx_{idx}
      , max_idx_{max_idx}
      , ep_{ep}
      , pathsDone_{pathsDone}
      , group_{group}
    {}
    void
    operator()(exception_ptr ex)
    {
      auto const sid = path_->pc_.scheduleID();
      TDEBUG_BEGIN_TASK_SI(4, sid);
      auto& workerInPath = path_->workers_[idx_];
      // Note: This will only be set false by a filter which has rejected.
      bool new_should_continue = workerInPath.returnCode();
      TDEBUG_TASK_SI(4, sid) << "new_should_continue: " << new_should_continue;
      if (ex) {
        try {
          rethrow_exception(ex);
        }
        catch (cet::exception& e) {
          auto action = path_->actionTable_.find(e.root_cause());
          assert(action != actions::FailModule);
          if (action != actions::FailPath) {
            // Possible actions: IgnoreCompletely, Rethrow, SkipEvent
            ++path_->timesExcept_;
            path_->state_ = hlt::Exception;
            if (path_->trptr_) {
              // Not the end path.
              path_->trptr_->at(path_->pathPosition_) =
                HLTPathStatus(path_->state_, idx_);
            }
            auto art_ex =
              Exception{
                errors::ScheduleExecutionFailure, "Path: ProcessingStopped.", e}
              << "Exception going through path " << path_->name() << '\n';
            auto ex_ptr = make_exception_ptr(art_ex);
            group_.may_run(pathsDone_, ex_ptr);
            TDEBUG_END_TASK_SI(4, sid) << "terminate path because of EXCEPTION";
            return;
          }
          new_should_continue = false;
          mf::LogWarning(e.category()) << "Failing path " << path_->name()
                                       << ", due to exception, message:\n"
                                       << e.what();
          // WARNING: We continue processing below!!!
        }
        catch (...) {
          mf::LogError("PassingThrough")
            << "Exception passing through path " << path_->name();
          ++path_->timesExcept_;
          path_->state_ = hlt::Exception;
          if (path_->trptr_) {
            // Not the end path.
            path_->trptr_->at(path_->pathPosition_) =
              HLTPathStatus(path_->state_, idx_);
          }
          group_.may_run(pathsDone_, current_exception());
          TDEBUG_END_TASK_SI(4, sid) << "terminate path because of EXCEPTION";
          return;
        }
      }

      path_->process_event_workerFinished(
        idx_, max_idx_, ep_, new_should_continue, pathsDone_);
      TDEBUG_END_TASK_SI(4, sid);
    }

  private:
    Path* path_;
    size_t const idx_;
    size_t const max_idx_;
    EventPrincipal& ep_;
    WaitingTaskPtr pathsDone_;
    GlobalTaskGroup& group_;
  };

  // This function is the main body of the Run Worker task.
  void
  Path::process_event_idx(size_t const idx,
                          size_t const max_idx,
                          EventPrincipal& ep,
                          WaitingTaskPtr pathsDone)
  {
    auto const sid = pc_.scheduleID();
    TDEBUG_FUNC_SI(4, sid) << "idx: " << idx << " max_idx: " << max_idx;
    auto workerDoneTask = make_waiting_task<WorkerDoneTask>(
      this, idx, max_idx, ep, pathsDone, taskGroup_);
    auto& workerInPath = workers_[idx];
    workerInPath.run(workerDoneTask, ep);
    TDEBUG_FUNC_SI(4, sid) << "idx: " << idx << " max_idx: " << max_idx;
  }

  void
  Path::process_event_workerFinished(size_t const idx,
                                     size_t const max_idx,
                                     EventPrincipal& ep,
                                     bool const should_continue,
                                     WaitingTaskPtr pathsDone)
  {
    auto const sid = pc_.scheduleID();
    TDEBUG_BEGIN_FUNC_SI(4, sid) << "idx: " << idx << " max_idx: " << max_idx
                                 << " should_continue: " << should_continue;
    auto new_idx = idx + 1;
    // Move on to the next worker.
    if (should_continue && (new_idx < max_idx)) {
      // Spawn the next worker.
      process_event_idx_asynch(new_idx, max_idx, ep, pathsDone);
      // And end this one.
      TDEBUG_END_FUNC_SI(4, sid)
        << "new_idx: " << new_idx << " max_idx: " << max_idx;
      return;
    }

    // All done, or filter rejected, or error.
    process_event_pathFinished(new_idx, should_continue, pathsDone);
    // And end the path here.
    TDEBUG_END_FUNC_SI(4, sid) << "idx: " << idx << " max_idx: " << max_idx;
  }

  void
  Path::process_event_pathFinished(size_t const idx,
                                   bool const should_continue,
                                   WaitingTaskPtr pathsDone)
  {
    // We come here as as part of a runWorker task.
    auto const sid = pc_.scheduleID();
    TDEBUG_FUNC_SI(4, sid) << "idx: " << idx
                           << " should_continue: " << should_continue;
    if (should_continue) {
      ++timesPassed_;
      state_ = hlt::Pass;
    } else {
      ++timesFailed_;
      state_ = hlt::Fail;
    }

    auto ex_ptr = std::exception_ptr{};
    try {
      HLTPathStatus const status{state_, idx};
      if (trptr_) {
        // Not the end path.
        trptr_->at(pathPosition_) = status;
      }
      actReg_.sPostProcessPath.invoke(pc_, status);
    }
    catch (...) {
      ex_ptr = std::current_exception();
    }
    taskGroup_.may_run(pathsDone, ex_ptr);
    TDEBUG_FUNC_SI(4, sid) << "idx: " << idx
                           << " should_continue: " << should_continue
                           << (ex_ptr ? " EXCEPTION" : "");
  }

} // namespace art