Newer
Older
Peterson, Peter
committed
#include "MantidAPI/Algorithm.h"
#include "MantidAPI/AlgorithmHistory.h"
#include "MantidAPI/AlgorithmManager.h"
#include "MantidAPI/AlgorithmProxy.h"
Peterson, Peter
committed
#include "MantidAPI/AnalysisDataService.h"
Peterson, Peter
committed
#include "MantidAPI/DeprecatedAlgorithm.h"
#include "MantidAPI/IWorkspaceProperty.h"
#include "MantidAPI/WorkspaceGroup.h"
#include "MantidAPI/WorkspaceHistory.h"
#include "MantidKernel/DateAndTime.h"
#include "MantidKernel/EmptyValues.h"
#include "MantidKernel/MultiThreaded.h"
#include "MantidKernel/Strings.h"
#include "MantidKernel/Timer.h"
Gigg, Martyn Anthony
committed
#include "MantidParallel/Communicator.h"
Gigg, Martyn Anthony
committed
#include <boost/algorithm/string/regex.hpp>
Gigg, Martyn Anthony
committed
#include <MantidKernel/StringTokenizer.h>
#include <Poco/ActiveMethod.h>
#include <Poco/ActiveResult.h>
#include <Poco/NotificationCenter.h>
#include <Poco/RWLock.h>
#include <map>
Peterson, Peter
committed
// Index property handling template definitions
#include "MantidAPI/Algorithm.tcc"
Peterson, Peter
committed
using namespace Mantid::Kernel;
namespace Mantid {
namespace API {
namespace {
/// Separator for workspace types in workspaceMethodOnTypes member
const std::string WORKSPACE_TYPES_SEPARATOR = ";";
class WorkspacePropertyValueIs {
public:
explicit WorkspacePropertyValueIs(const std::string &value)
: m_value(value){};
bool operator()(IWorkspaceProperty *property) {
Property *prop = dynamic_cast<Property *>(property);
if (!prop)
return false;
return prop->value() == m_value;
}
private:
// Doxygen can't handle member specialization at the moment:
// https://bugzilla.gnome.org/show_bug.cgi?id=406027
// so we have to ignore them
///@cond
template <typename NumT> bool Algorithm::isEmpty(const NumT toCheck) {
return static_cast<int>(toCheck) == EMPTY_INT();
}
template <> MANTID_API_DLL bool Algorithm::isEmpty(const double toCheck) {
return std::abs((toCheck - EMPTY_DBL()) / (EMPTY_DBL())) < 1e-8;
}
// concrete instantiations
template MANTID_API_DLL bool Algorithm::isEmpty<int>(const int);
template MANTID_API_DLL bool Algorithm::isEmpty<int64_t>(const int64_t);
template MANTID_API_DLL bool Algorithm::isEmpty<std::size_t>(const std::size_t);
///@endcond
//=============================================================================================
//================================== Constructors/Destructors
//=================================
//=============================================================================================
/// Initialize static algorithm counter
size_t Algorithm::g_execCount = 0;
/// Constructor
Algorithm::Algorithm()
: PropertyManagerOwner(), m_cancel(false), m_parallelException(false),
m_log("Algorithm"), g_log(m_log), m_groupSize(0), m_executeAsync(nullptr),
m_notificationCenter(nullptr), m_progressObserver(nullptr),
m_isInitialized(false), m_isExecuted(false), m_isChildAlgorithm(false),
m_recordHistoryForChild(false), m_alwaysStoreInADS(true),
m_runningAsync(false), m_running(false), m_rethrow(false),
Federico Montesino Pouzols
committed
m_isAlgStartupLoggingEnabled(true), m_startChildProgress(0.),
m_endChildProgress(0.), m_algorithmID(this), m_singleGroup(-1),
m_groupsHaveSimilarNames(false),
m_communicator(Kernel::make_unique<Parallel::Communicator>()) {}
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
/// Virtual destructor
Algorithm::~Algorithm() {
delete m_notificationCenter;
delete m_executeAsync;
delete m_progressObserver;
}
//=============================================================================================
//================================== Simple Getters/Setters
//===================================
//=============================================================================================
//---------------------------------------------------------------------------------------------
/// Has the Algorithm already been initialized
bool Algorithm::isInitialized() const { return m_isInitialized; }
/// Has the Algorithm already been executed
bool Algorithm::isExecuted() const { return m_isExecuted; }
//---------------------------------------------------------------------------------------------
/// Set the Algorithm initialized state
void Algorithm::setInitialized() { m_isInitialized = true; }
/** Set the executed flag to the specified state
// Public in Gaudi - don't know why and will leave here unless we find a reason
otherwise
// Also don't know reason for different return type and argument.
@param state :: New executed state
*/
void Algorithm::setExecuted(bool state) { m_isExecuted = state; }
//---------------------------------------------------------------------------------------------
/** To query whether algorithm is a child.
* @returns true - the algorithm is a child algorithm. False - this is a full
* managed algorithm.
*/
bool Algorithm::isChild() const { return m_isChildAlgorithm; }
/** To set whether algorithm is a child.
* @param isChild :: True - the algorithm is a child algorithm. False - this
* is a full managed algorithm.
*/
void Algorithm::setChild(const bool isChild) {
m_isChildAlgorithm = isChild;
this->setAlwaysStoreInADS(!isChild);
}
/**
* Change the state of the history recording flag. Only applicable for
* child algorithms.
* @param on :: The new state of the flag
*/
void Algorithm::enableHistoryRecordingForChild(const bool on) {
m_recordHistoryForChild = on;
}
/** Do we ALWAYS store in the AnalysisDataService? This is set to true
* for python algorithms' child algorithms
*
* @param doStore :: always store in ADS
*/
void Algorithm::setAlwaysStoreInADS(const bool doStore) {
m_alwaysStoreInADS = doStore;
}
/** Set whether the algorithm will rethrow exceptions
* @param rethrow :: true if you want to rethrow exception.
*/
void Algorithm::setRethrows(const bool rethrow) { this->m_rethrow = rethrow; }
/// True if the algorithm is running.
bool Algorithm::isRunning() const { return m_running; }
//---------------------------------------------------------------------------------------------
/** Add an observer to a notification
@param observer :: Reference to the observer to add
*/
void Algorithm::addObserver(const Poco::AbstractObserver &observer) const {
notificationCenter().addObserver(observer);
}
/** Remove an observer
@param observer :: Reference to the observer to remove
*/
void Algorithm::removeObserver(const Poco::AbstractObserver &observer) const {
notificationCenter().removeObserver(observer);
}
//---------------------------------------------------------------------------------------------
/** Sends ProgressNotification.
* @param p :: Reported progress, must be between 0 (just started) and 1
* (finished)
* @param msg :: Optional message string
* @param estimatedTime :: Optional estimated time to completion
* @param progressPrecision :: optional, int number of digits after the decimal
* point to show.
void Algorithm::progress(double p, const std::string &msg, double estimatedTime,
int progressPrecision) {
notificationCenter().postNotification(
new ProgressNotification(this, p, msg, estimatedTime, progressPrecision));
}
//---------------------------------------------------------------------------------------------
/// Function to return all of the categories that contain this algorithm
const std::vector<std::string> Algorithm::categories() const {
Mantid::Kernel::StringTokenizer tokenizer(
category(), categorySeparator(),
Mantid::Kernel::StringTokenizer::TOK_TRIM |
Mantid::Kernel::StringTokenizer::TOK_IGNORE_EMPTY);
auto res = tokenizer.asVector();
Peterson, Peter
committed
const DeprecatedAlgorithm *depo =
dynamic_cast<const DeprecatedAlgorithm *>(this);
if (depo != nullptr) {
}
return res;
}
/**
* @return A string giving the method name that should be attached to a
* workspace
*/
const std::string Algorithm::workspaceMethodName() const { return ""; }
/**
*
* @return A list of workspace class names that should have the
*workspaceMethodName attached
*/
const std::vector<std::string> Algorithm::workspaceMethodOn() const {
Mantid::Kernel::StringTokenizer tokenizer(
this->workspaceMethodOnTypes(), WORKSPACE_TYPES_SEPARATOR,
Mantid::Kernel::StringTokenizer::TOK_TRIM |
Mantid::Kernel::StringTokenizer::TOK_IGNORE_EMPTY);
return tokenizer.asVector();
}
/**
* @return The name of the property that the calling object will be passed to.
*/
const std::string Algorithm::workspaceMethodInputProperty() const { return ""; }
//=============================================================================================
//================================== Initialization
//===========================================
//=============================================================================================
//---------------------------------------------------------------------------------------------
/** Initialization method invoked by the framework. This method is responsible
* for any bookkeeping of initialization required by the framework itself.
* It will in turn invoke the init() method of the derived algorithm,
* and of any Child Algorithms which it creates.
* @throw runtime_error Thrown if algorithm or Child Algorithm cannot be
*initialised
*
*/
void Algorithm::initialize() {
// Bypass the initialization if the algorithm has already been initialized.
if (m_isInitialized)
return;
g_log.setName(this->name());
setLoggingOffset(0);
try {
try {
this->init();
setupSkipValidationMasterOnly();
} catch (std::runtime_error &) {
throw;
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
// Indicate that this Algorithm has been initialized to prevent duplicate
// attempts.
setInitialized();
} catch (std::runtime_error &) {
throw;
}
// Unpleasant catch-all! Along with this, Gaudi version catches GaudiException
// & std::exception
// but doesn't really do anything except (print fatal) messages.
catch (...) {
// Gaudi: A call to the auditor service is here
// (1) perform the printout
getLogger().fatal("UNKNOWN Exception is caught in initialize()");
throw;
}
}
//---------------------------------------------------------------------------------------------
/** Perform validation of ALL the input properties of the algorithm.
* This is to be overridden by specific algorithms.
* It will be called in dialogs after parsing all inputs and setting the
* properties, but BEFORE executing.
*
* @return a map where: Key = string name of the the property;
Value = string describing the problem with the property.
*/
std::map<std::string, std::string> Algorithm::validateInputs() {
return std::map<std::string, std::string>();
}
//---------------------------------------------------------------------------------------------
/** Go through the properties and cache the input/output
* workspace properties for later use.
*/
void Algorithm::cacheWorkspaceProperties() {
// Cache the list of the in/out workspace properties
m_inputWorkspaceProps.clear();
m_outputWorkspaceProps.clear();
m_pureOutputWorkspaceProps.clear();
const std::vector<Property *> &props = this->getProperties();
IWorkspaceProperty *wsProp = dynamic_cast<IWorkspaceProperty *>(prop);
if (wsProp) {
switch (prop->direction()) {
case Kernel::Direction::Input:
m_inputWorkspaceProps.push_back(wsProp);
break;
case Kernel::Direction::InOut:
m_inputWorkspaceProps.push_back(wsProp);
m_outputWorkspaceProps.push_back(wsProp);
break;
case Kernel::Direction::Output:
m_outputWorkspaceProps.push_back(wsProp);
m_pureOutputWorkspaceProps.push_back(wsProp);
break;
default:
throw std::logic_error(
"Unexpected property direction found for property " + prop->name() +
" of algorithm " + this->name());
} // is a ws property
} // each property
}
//=============================================================================================
//================================== Execution
//================================================
//=============================================================================================
//---------------------------------------------------------------------------------------------
/** Go through the workspace properties of this algorithm
* and lock the workspaces for reading or writing.
*
*/
void Algorithm::lockWorkspaces() {
// Do not lock workspace for child algos
if (this->isChild())
return;
if (!m_readLockedWorkspaces.empty() || !m_writeLockedWorkspaces.empty())
throw std::logic_error("Algorithm::lockWorkspaces(): The workspaces have "
"already been locked!");
// First, Write-lock the output workspaces
auto &debugLog = g_log.debug();
for (auto &outputWorkspaceProp : m_outputWorkspaceProps) {
Workspace_sptr ws = outputWorkspaceProp->getWorkspace();
if (ws) {
// The workspace property says to do locking,
// AND it has NOT already been write-locked
std::find(m_writeLockedWorkspaces.begin(),
m_writeLockedWorkspaces.end(),
ws) == m_writeLockedWorkspaces.end()) {
// Write-lock it if not already
debugLog << "Write-locking " << ws->getName() << '\n';
ws->getLock()->writeLock();
m_writeLockedWorkspaces.push_back(ws);
// Next read-lock the input workspaces
for (auto &inputWorkspaceProp : m_inputWorkspaceProps) {
Workspace_sptr ws = inputWorkspaceProp->getWorkspace();
if (ws) {
// The workspace property says to do locking,
// AND it has NOT already been write-locked
std::find(m_writeLockedWorkspaces.begin(),
m_writeLockedWorkspaces.end(),
ws) == m_writeLockedWorkspaces.end()) {
// Read-lock it if not already write-locked
debugLog << "Read-locking " << ws->getName() << '\n';
ws->getLock()->readLock();
m_readLockedWorkspaces.push_back(ws);
}
}
}
//---------------------------------------------------------------------------------------------
/** Unlock any previously locked workspaces
*
*/
void Algorithm::unlockWorkspaces() {
// Do not lock workspace for child algos
if (this->isChild())
return;
auto &debugLog = g_log.debug();
for (auto &ws : m_writeLockedWorkspaces) {
debugLog << "Unlocking " << ws->getName() << '\n';
for (auto &ws : m_readLockedWorkspaces) {
debugLog << "Unlocking " << ws->getName() << '\n';
// Don't double-unlock workspaces
m_readLockedWorkspaces.clear();
m_writeLockedWorkspaces.clear();
}
//---------------------------------------------------------------------------------------------
/** The actions to be performed by the algorithm on a dataset. This method is
* invoked for top level algorithms by the application manager.
* This method invokes exec() method.
* For Child Algorithms either the execute() method or exec() method
* must be EXPLICITLY invoked by the parent algorithm.
*
* @throw runtime_error Thrown if algorithm or Child Algorithm cannot be
*executed
* @return true if executed successfully.
*/
bool Algorithm::execute() {
AlgorithmManager::Instance().notifyAlgorithmStarting(this->getAlgorithmID());
{
DeprecatedAlgorithm *depo = dynamic_cast<DeprecatedAlgorithm *>(this);
if (depo != nullptr)
getLogger().error(depo->deprecationMsg(this));
}
notificationCenter().postNotification(new StartedNotification(this));
Mantid::Types::Core::DateAndTime startTime;
// Return a failure if the algorithm hasn't been initialized
if (!isInitialized()) {
throw std::runtime_error("Algorithm is not initialised:" + this->name());
}
// Cache the workspace in/out properties for later use
cacheWorkspaceProperties();
// no logging of input if a child algorithm (except for python child algos)
if (!m_isChildAlgorithm || m_alwaysStoreInADS)
logAlgorithmInfo();
// Check all properties for validity
if (!validateProperties()) {
// Reset name on input workspaces to trigger attempt at collection from ADS
const std::vector<Property *> &props = getProperties();
IWorkspaceProperty *wsProp = dynamic_cast<IWorkspaceProperty *>(prop);
if (wsProp && !(wsProp->getWorkspace())) {
// Setting it's name to the same one it already had
prop->setValue(prop->value());
// Try the validation again
if (!validateProperties()) {
notificationCenter().postNotification(
new ErrorNotification(this, "Some invalid Properties found"));
throw std::runtime_error("Some invalid Properties found");
// ----- Check for processing groups -------------
// default true so that it has the right value at the check below the catch
// block should checkGroups throw
bool callProcessGroups = true;
try {
// Checking the input is a group. Throws if the sizes are wrong
callProcessGroups = this->checkGroups();
} catch (std::exception &ex) {
getLogger().error() << "Error in execution of algorithm " << this->name()
notificationCenter().postNotification(
new ErrorNotification(this, ex.what()));
m_running = false;
if (m_isChildAlgorithm || m_runningAsync || m_rethrow) {
m_runningAsync = false;
throw;
// ----- Perform validation of the whole set of properties -------------
if (!callProcessGroups) // for groups this is called on each workspace
// separately
{
std::map<std::string, std::string> errors = this->validateInputs();
if (!errors.empty()) {
size_t numErrors = errors.size();
// Log each issue
auto &errorLog = getLogger().error();
auto &warnLog = getLogger().warning();
for (auto &error : errors) {
if (this->existsProperty(error.first))
errorLog << "Invalid value for " << error.first << ": "
<< error.second << "\n";
else {
numErrors -= 1; // don't count it as an error
warnLog << "validateInputs() references non-existant property \""
// Throw because something was invalid
if (numErrors > 0) {
notificationCenter().postNotification(
new ErrorNotification(this, "Some invalid Properties found"));
throw std::runtime_error("Some invalid Properties found");
Russell Taylor
committed
if (trackingHistory()) {
// count used for defining the algorithm execution order
// If history is being recorded we need to count this as a separate
// algorithm
// as the history compares histories by their execution number
++Algorithm::g_execCount;
// populate history record before execution so we can record child
// algorithms in it
AlgorithmHistory algHist;
m_history = boost::make_shared<AlgorithmHistory>(algHist);
}
// ----- Process groups -------------
// If checkGroups() threw an exception but there ARE group workspaces
// (means that the group sizes were incompatible)
if (callProcessGroups) {
Federico Montesino Pouzols
committed
return doCallProcessGroups(startTime);
// Read or write locks every input/output workspace
this->lockWorkspaces();
// Invoke exec() method of derived class and catch all uncaught exceptions
try {
try {
if (!isChild()) {
m_running = true;
startTime = Mantid::Types::Core::DateAndTime::getCurrentTime();
// Start a timer
Timer timer;
// Call the concrete algorithm's exec method
this->exec(getExecutionMode());
// Check for a cancellation request in case the concrete algorithm doesn't
interruption_point();
// Get how long this algorithm took to run
const float duration = timer.elapsed();
// need it to throw before trying to run fillhistory() on an algorithm
// which has failed
if (trackingHistory() && m_history) {
Federico Montesino Pouzols
committed
m_history->fillAlgorithmHistory(this, startTime, duration,
Algorithm::g_execCount);
fillHistory();
linkHistoryWithLastChild();
// Put the output workspaces into the AnalysisDataService - if requested
if (m_alwaysStoreInADS)
// RJT, 19/3/08: Moved this up from below the catch blocks
setExecuted(true);
// Log that execution has completed.
reportCompleted(duration);
} catch (std::runtime_error &ex) {
this->unlockWorkspaces();
if (m_isChildAlgorithm || m_runningAsync || m_rethrow)
getLogger().error() << "Error in execution of algorithm "
<< this->name() << '\n' << ex.what() << '\n';
notificationCenter().postNotification(
new ErrorNotification(this, ex.what()));
m_running = false;
} catch (std::logic_error &ex) {
this->unlockWorkspaces();
if (m_isChildAlgorithm || m_runningAsync || m_rethrow)
getLogger().error() << "Logic Error in execution of algorithm "
<< this->name() << '\n' << ex.what() << '\n';
notificationCenter().postNotification(
new ErrorNotification(this, ex.what()));
m_running = false;
} catch (CancelException &ex) {
m_runningAsync = false;
m_running = false;
getLogger().error() << this->name() << ": Execution terminated by user.\n";
notificationCenter().postNotification(
new ErrorNotification(this, ex.what()));
this->unlockWorkspaces();
throw;
}
// Gaudi also specifically catches GaudiException & std:exception.
catch (std::exception &ex) {
setExecuted(false);
m_runningAsync = false;
m_running = false;
notificationCenter().postNotification(
new ErrorNotification(this, ex.what()));
getLogger().error() << "Error in execution of algorithm " << this->name()
this->unlockWorkspaces();
throw;
}
Russell Taylor
committed
catch (...) {
// Execution failed
setExecuted(false);
m_runningAsync = false;
m_running = false;
notificationCenter().postNotification(
new ErrorNotification(this, "UNKNOWN Exception is caught in exec()"));
getLogger().error() << this->name()
<< ": UNKNOWN Exception is caught in exec()\n";
this->unlockWorkspaces();
throw;
}
// Unlock the locked workspaces
this->unlockWorkspaces();
notificationCenter().postNotification(
new FinishedNotification(this, isExecuted()));
// Only gets to here if algorithm ended normally
return isExecuted();
}
//---------------------------------------------------------------------------------------------
/** Execute as a Child Algorithm.
* This runs execute() but catches errors so as to log the name
* of the failed Child Algorithm, if it fails.
*/
void Algorithm::executeAsChildAlg() {
bool executed = false;
try {
executed = execute();
} catch (std::runtime_error &) {
throw;
}
if (!executed) {
throw std::runtime_error("Unable to successfully run ChildAlgorithm " +
this->name());
}
}
//---------------------------------------------------------------------------------------------
/** Stores any output workspaces into the AnalysisDataService
* @throw std::runtime_error If unable to successfully store an output
* workspace
*/
void Algorithm::store() {
const std::vector<Property *> &props = getProperties();
std::vector<int> groupWsIndicies;
// add any regular/child workspaces first, then add the groups
for (unsigned int i = 0; i < props.size(); ++i) {
IWorkspaceProperty *wsProp = dynamic_cast<IWorkspaceProperty *>(props[i]);
if (wsProp) {
// check if the workspace is a group, if so remember where it is and add
// it later
auto group =
boost::dynamic_pointer_cast<WorkspaceGroup>(wsProp->getWorkspace());
if (!group) {
try {
wsProp->store();
} catch (std::runtime_error &) {
throw;
} else {
groupWsIndicies.push_back(i);
Peterson, Peter
committed
// now store workspace groups once their members have been added
std::vector<int>::const_iterator wsIndex;
for (wsIndex = groupWsIndicies.begin(); wsIndex != groupWsIndicies.end();
++wsIndex) {
IWorkspaceProperty *wsProp =
dynamic_cast<IWorkspaceProperty *>(props[*wsIndex]);
if (wsProp) {
try {
wsProp->store();
} catch (std::runtime_error &) {
throw;
Peterson, Peter
committed
}
}
}
}
//---------------------------------------------------------------------------------------------
/** Create a Child Algorithm. A call to this method creates a child algorithm
*object.
* Using this mechanism instead of creating daughter
* algorithms directly via the new operator is prefered since then
* the framework can take care of all of the necessary book-keeping.
*
* @param name :: The concrete algorithm class of the Child Algorithm
* @param startProgress :: The percentage progress value of the overall
*algorithm where this child algorithm starts
* @param endProgress :: The percentage progress value of the overall
*algorithm where this child algorithm ends
* @param enableLogging :: Set to false to disable logging from the child
*algorithm
* @param version :: The version of the child algorithm to create. By
*default gives the latest version.
* @return shared pointer to the newly created algorithm object
*/
Algorithm_sptr Algorithm::createChildAlgorithm(const std::string &name,
const double startProgress,
const double endProgress,
const bool enableLogging,
const int &version) {
Algorithm_sptr alg =
AlgorithmManager::Instance().createUnmanaged(name, version);
// set as a child
alg->setLogging(enableLogging);
// Initialise the Child Algorithm
try {
alg->initialize();
} catch (std::runtime_error &) {
throw std::runtime_error("Unable to initialise Child Algorithm '" + name +
"'");
}
// If output workspaces are nameless, give them a temporary name to satisfy
// validator
const std::vector<Property *> &props = alg->getProperties();
for (auto prop : props) {
auto wsProp = dynamic_cast<IWorkspaceProperty *>(prop);
if (prop->direction() == Mantid::Kernel::Direction::Output && wsProp) {
if (prop->value().empty()) {
prop->createTemporaryValue();
Peterson, Peter
committed
}
if (startProgress >= 0.0 && endProgress > startProgress &&
endProgress <= 1.0) {
alg->addObserver(this->progressObserver());
m_startChildProgress = startProgress;
m_endChildProgress = endProgress;
}
Peterson, Peter
committed
// Before we return the shared pointer, use it to create a weak pointer and
// keep that in a vector.
// It will be used this to pass on cancellation requests
// It must be protected by a critical block so that Child Algorithms can run
// in parallel safely.
boost::weak_ptr<IAlgorithm> weakPtr(alg);
PARALLEL_CRITICAL(Algorithm_StoreWeakPtr) {
m_ChildAlgorithms.push_back(weakPtr);
}
return alg;
}
//=============================================================================================
//================================== Algorithm History
//========================================
//=============================================================================================
/**
* Serialize this object to a string. The format is
* @returns This object serialized as a string
*/
std::string Algorithm::toString() const {
::Json::FastWriter writer;
return writer.write(toJson());
}
/**
* Serialize this object to a json object)
* @returns This object serialized as a json object
*/
::Json::Value Algorithm::toJson() const {
::Json::Value root;
root["name"] = name();
root["version"] = this->version();
root["properties"] = Kernel::PropertyManagerOwner::asJson(false);
}
//--------------------------------------------------------------------------------------------
/** Construct an object from a history entry.
*
* This creates the algorithm and sets all of its properties using the history.
*
* @param history :: AlgorithmHistory object
* @return a shared pointer to the created algorithm.
*/
IAlgorithm_sptr Algorithm::fromHistory(const AlgorithmHistory &history) {
::Json::Value root;
::Json::Value jsonMap;
::Json::FastWriter writer;
auto props = history.getProperties();
const size_t numProps(props.size());
for (size_t i = 0; i < numProps; ++i) {
PropertyHistory_sptr prop = props[i];
if (!prop->isDefault()) {
jsonMap[prop->name()] = prop->value();
root["name"] = history.name();
root["version"] = history.version();
root["properties"] = jsonMap;
const std::string output = writer.write(root);
IAlgorithm_sptr alg;
try {
alg = Algorithm::fromString(output);
} catch (std::invalid_argument &) {
throw std::runtime_error(
"Could not create algorithm from history. "
"Is this a child algorithm whose workspaces are not in the ADS?");
}
return alg;
}
//--------------------------------------------------------------------------------------------
/** De-serializes the algorithm from a string
*
* @param input :: An input string in the format. The format is
* AlgorithmName.version(prop1=value1,prop2=value2,...). If .version is
*not found the
* highest found is used.
* @return A pointer to a managed algorithm object
*/
IAlgorithm_sptr Algorithm::fromString(const std::string &input) {
::Json::Value root;
::Json::Reader reader;
if (reader.parse(input, root)) {
const std::string algName = root["name"].asString();
int version = 0;
try {
version = root["version"].asInt();
} catch (std::runtime_error &) {
// do nothing - the next test will catch it
Gigg, Martyn Anthony
committed
}
Federico Montesino Pouzols
committed
IAlgorithm_sptr alg =
AlgorithmManager::Instance().createUnmanaged(algName, version);
alg->initialize();
// get properties
alg->setProperties(root["properties"]);
return alg;
} else {
throw std::runtime_error("Cannot create algorithm, invalid string format.");
}
}
//-------------------------------------------------------------------------
/** Initialize using proxy algorithm.
* Call the main initialize method and then copy in the property values.
* @param proxy :: Initialising proxy algorithm */
void Algorithm::initializeFromProxy(const AlgorithmProxy &proxy) {
initialize();
copyPropertiesFrom(proxy);
m_algorithmID = proxy.getAlgorithmID();
setLogging(proxy.isLogging());
setLoggingOffset(proxy.getLoggingOffset());
setAlgStartupLogging(proxy.getAlgStartupLogging());
setChild(proxy.isChild());
setAlwaysStoreInADS(proxy.getAlwaysStoreInADS());
}
/** Fills History, Algorithm History and Algorithm Parameters
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
void Algorithm::fillHistory() {
// this is not a child algorithm. Add the history algorithm to the
// WorkspaceHistory object.
if (!isChild()) {
// Create two vectors to hold a list of pointers to the input & output
// workspaces (InOut's go in both)
std::vector<Workspace_sptr> inputWorkspaces, outputWorkspaces;
std::vector<Workspace_sptr>::iterator outWS;
std::vector<Workspace_sptr>::const_iterator inWS;
findWorkspaceProperties(inputWorkspaces, outputWorkspaces);
// Loop over the output workspaces
for (outWS = outputWorkspaces.begin(); outWS != outputWorkspaces.end();
++outWS) {
WorkspaceGroup_sptr wsGroup =
boost::dynamic_pointer_cast<WorkspaceGroup>(*outWS);
// Loop over the input workspaces, making the call that copies their
// history to the output ones
// (Protection against copy to self is in
// WorkspaceHistory::copyAlgorithmHistory)
for (inWS = inputWorkspaces.begin(); inWS != inputWorkspaces.end();
++inWS) {
(*outWS)->history().addHistory((*inWS)->getHistory());
// Add history to each child of output workspace group
if (wsGroup) {
for (size_t i = 0; i < wsGroup->size(); i++) {
wsGroup->getItem(i)->history().addHistory((*inWS)->getHistory());
Gigg, Martyn Anthony
committed
}
}
Peterson, Peter
committed
// Add the history for the current algorithm to all the output workspaces
(*outWS)->history().addHistory(m_history);
// Add history to each child of output workspace group
if (wsGroup) {
for (size_t i = 0; i < wsGroup->size(); i++) {
wsGroup->getItem(i)->history().addHistory(m_history);
Peterson, Peter
committed
}
}
// this is a child algorithm, but we still want to keep the history.
else if (m_recordHistoryForChild && m_parentHistory) {
m_parentHistory->addChildHistory(m_history);
}
}
/**
* Link the name of the output workspaces on this parent algorithm.
* with the last child algorithm executed to ensure they match in the history.
*
* This solves the case where child algorithms use a temporary name and this
* name needs to match the output name of the parent algorithm so the history
*can be re-run.
*/
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
void Algorithm::linkHistoryWithLastChild() {
if (m_recordHistoryForChild) {
// iterate over the algorithms output workspaces
const std::vector<Property *> &algProperties = getProperties();
std::vector<Property *>::const_iterator it;
for (it = algProperties.begin(); it != algProperties.end(); ++it) {
const IWorkspaceProperty *outputProp =
dynamic_cast<IWorkspaceProperty *>(*it);
if (outputProp) {
// Check we actually have a workspace, it may have been optional
Workspace_sptr workspace = outputProp->getWorkspace();
if (!workspace)
continue;
// Check it's an output workspace
if ((*it)->direction() == Kernel::Direction::Output ||
(*it)->direction() == Kernel::Direction::InOut) {
bool linked = false;
// find child histories with anonymous output workspaces
auto childHistories = m_history->getChildHistories();
auto childIter = childHistories.rbegin();
for (; childIter != childHistories.rend() && !linked; ++childIter) {
auto props = (*childIter)->getProperties();
auto propIter = props.begin();
for (; propIter != props.end() && !linked; ++propIter) {
// check we have a workspace property
if ((*propIter)->direction() == Kernel::Direction::Output ||
(*propIter)->direction() == Kernel::Direction::InOut) {
// if the workspaces are equal, then rename the history
std::ostringstream os;
os << "__TMP" << outputProp->getWorkspace().get();
if (os.str() == (*propIter)->value()) {
(*propIter)->setValue((*it)->value());
linked = true;
}
}
}
}
}
}
}
}
}
/** Indicates that this algrithms history should be tracked regardless of if it
* is a child.
* @param parentHist :: the parent algorithm history object the history in.
*/
void Algorithm::trackAlgorithmHistory(
boost::shared_ptr<AlgorithmHistory> parentHist) {
enableHistoryRecordingForChild(true);
m_parentHistory = parentHist;
}
/** Check if we are tracking history for thus algorithm
* @return if we are tracking the history of this algorithm
*/
bool Algorithm::trackingHistory() {
return (!isChild() || m_recordHistoryForChild);
}
/** Populate lists of the input & output workspace properties.
* (InOut workspaces go in both lists)
* @param inputWorkspaces :: A reference to a vector for the input workspaces
* @param outputWorkspaces :: A reference to a vector for the output workspaces
*/
void Algorithm::findWorkspaceProperties(
std::vector<Workspace_sptr> &inputWorkspaces,
std::vector<Workspace_sptr> &outputWorkspaces) const {
// Loop over properties looking for the workspace properties and putting them
// in the right list
const std::vector<Property *> &algProperties = getProperties();
std::vector<Property *>::const_iterator it;
for (it = algProperties.begin(); it != algProperties.end(); ++it) {
const IWorkspaceProperty *wsProp = dynamic_cast<IWorkspaceProperty *>(*it);
if (wsProp) {
const Property *wsPropProp = dynamic_cast<Property *>(*it);
// Check we actually have a workspace, it may have been optional
Workspace_sptr workspace = wsProp->getWorkspace();
if (!workspace)
continue;
unsigned int direction = wsPropProp->direction();
if (direction == Direction::Input || direction == Direction::InOut) {
inputWorkspaces.push_back(workspace);
Peterson, Peter
committed
}
if (direction == Direction::Output || direction == Direction::InOut) {
outputWorkspaces.push_back(workspace);
}
}
/** Sends out algorithm parameter information to the logger */
void Algorithm::logAlgorithmInfo() const {
auto &logger = getLogger();
if (m_isAlgStartupLoggingEnabled) {
logger.notice() << name() << " started";
if (this->isChild())
logger.notice() << " (child)";
// Make use of the AlgorithmHistory class, which holds all the info we want
// here
AlgorithmHistory algHistory(this);
size_t maxPropertyLength = 40;
if (logger.is(Logger::Priority::PRIO_DEBUG)) {
// include the full property value when logging in debug
maxPropertyLength = 0;
}
algHistory.printSelf(logger.information(), 0, maxPropertyLength);
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
}
}
//=============================================================================================
//================================== WorkspaceGroup-related
//===================================
//=============================================================================================
/** Check the input workspace properties for groups.
*
* If there are more than one input workspace properties, then:
* - All inputs should be groups of the same size
* - In this case, algorithms are processed in order
* - OR, only one input should be a group, the others being size of 1
*
* If the property itself is a WorkspaceProperty<WorkspaceGroup> then
* this returns false
*
* Returns true if processGroups() should be called.
* It also sets up some other members.
*
* Override if it is needed to customize the group checking.
*
* @throw std::invalid_argument if the groups sizes are incompatible.
* @throw std::invalid_argument if a member is not found
*
* This method (or an override) must NOT THROW any exception if there are no
*input workspace groups
*/
bool Algorithm::checkGroups() {
size_t numGroups = 0;
bool processGroups = false;
// Unroll the groups or single inputs into vectors of workspace
m_groups.clear();
m_groupWorkspaces.clear();
for (auto inputWorkspaceProp : m_inputWorkspaceProps) {
auto prop = dynamic_cast<Property *>(inputWorkspaceProp);
auto wsGroupProp = dynamic_cast<WorkspaceProperty<WorkspaceGroup> *>(prop);
std::vector<Workspace_sptr> thisGroup;
Workspace_sptr ws = inputWorkspaceProp->getWorkspace();
WorkspaceGroup_sptr wsGroup =
boost::dynamic_pointer_cast<WorkspaceGroup>(ws);
// Workspace groups are NOT returned by IWP->getWorkspace() most of the time
// because WorkspaceProperty is templated by <MatrixWorkspace>
// and WorkspaceGroup does not subclass <MatrixWorkspace>
if (!wsGroup && prop && !prop->value().empty()) {
// So try to use the name in the AnalysisDataService
try {
wsGroup = AnalysisDataService::Instance().retrieveWS<WorkspaceGroup>(
prop->value());
} catch (Exception::NotFoundError &) { /* Do nothing */
// Found the group either directly or by name?
// If the property is of type WorkspaceGroup then don't unroll
if (wsGroup && !wsGroupProp) {
numGroups++;
processGroups = true;
std::vector<std::string> names = wsGroup->getNames();
for (auto &name : names) {
AnalysisDataService::Instance().retrieve(name);
if (!memberWS)
throw std::invalid_argument("One of the members of " +
wsGroup->getName() + ", " + name +
" was not found!.");
thisGroup.push_back(memberWS);
} else {
// Single Workspace. Treat it as a "group" with only one member
if (ws)
thisGroup.push_back(ws);
// Add to the list of groups
m_groups.push_back(thisGroup);
m_groupWorkspaces.push_back(wsGroup);
}
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
// No groups? Get out.
if (numGroups == 0)
return processGroups;
// ---- Confirm that all the groups are the same size -----
// Index of the single group
m_singleGroup = -1;
// Size of the single or of all the groups
m_groupSize = 1;
m_groupsHaveSimilarNames = true;
for (size_t i = 0; i < m_groups.size(); i++) {
std::vector<Workspace_sptr> &thisGroup = m_groups[i];
// We're ok with empty groups if the workspace property is optional
if (thisGroup.empty() && !m_inputWorkspaceProps[i]->isOptional())
throw std::invalid_argument("Empty group passed as input");
if (!thisGroup.empty()) {
// Record the index of the single group.
WorkspaceGroup_sptr wsGroup = m_groupWorkspaces[i];
if (wsGroup && (numGroups == 1))
m_singleGroup = int(i);
// For actual groups (>1 members)
if (thisGroup.size() > 1) {
// Check for matching group size
if (m_groupSize > 1)
if (thisGroup.size() != m_groupSize)
throw std::invalid_argument(
"Input WorkspaceGroups are not of the same size.");
// Are ALL the names similar?
if (wsGroup)
m_groupsHaveSimilarNames =
m_groupsHaveSimilarNames && wsGroup->areNamesSimilar();
// Save the size for the next group
m_groupSize = thisGroup.size();
Alex Buts
committed
}
} // end for each group
// If you get here, then the groups are compatible
return processGroups;
}
Federico Montesino Pouzols
committed
/**
* Calls process groups with the required timing checks and algorithm
* execution finalization steps.
*
* @param startTime to record the algorithm execution start
*
* @return whether processGroups succeeds.
*/
bool Algorithm::doCallProcessGroups(
Mantid::Types::Core::DateAndTime &startTime) {
Federico Montesino Pouzols
committed
// In the base implementation of processGroups, this normally calls
// this->execute() again on each member of the group. Other algorithms may
// choose to override that behavior (examples: CompareWorkspaces,
// CheckWorkspacesMatch, RenameWorkspace)
startTime = Mantid::Types::Core::DateAndTime::getCurrentTime();
Federico Montesino Pouzols
committed
// Start a timer
Timer timer;
bool completed = false;
try {
// Call the concrete algorithm's processGroups method
completed = processGroups();
} catch (std::exception &ex) {
// The child algorithm will already have logged the error etc.,
// but we also need to update flags in the parent algorithm and
// send an ErrorNotification (because the child isn't registered with the
// AlgorithmMonitor).
setExecuted(false);
m_runningAsync = false;
m_running = false;
notificationCenter().postNotification(
new ErrorNotification(this, ex.what()));
throw;
} catch (...) {
setExecuted(false);
m_runningAsync = false;
m_running = false;
notificationCenter().postNotification(new ErrorNotification(
this, "UNKNOWN Exception caught from processGroups"));
throw;
Federico Montesino Pouzols
committed
// Check for a cancellation request in case the concrete algorithm doesn't
interruption_point();
if (completed) {
// in the base processGroups each individual exec stores its outputs
if (!m_usingBaseProcessGroups && m_alwaysStoreInADS)
Federico Montesino Pouzols
committed
this->store();
// Get how long this algorithm took to run
const float duration = timer.elapsed();
// Log that execution has completed.
reportCompleted(duration, true /* this is for group processing*/);
}
setExecuted(completed);
notificationCenter().postNotification(
new FinishedNotification(this, isExecuted()));
return completed;
}
//--------------------------------------------------------------------------------------------
/** Process WorkspaceGroup inputs.
*
* This should be called after checkGroups(), which sets up required members.
* It goes through each member of the group(s), creates and sets an algorithm
* for each and executes them one by one.
*
* If there are several group input workspaces, then the member of each group
* is executed pair-wise.
*
* @return true - if all the workspace members are executed.
*/
bool Algorithm::processGroups() {
Federico Montesino Pouzols
committed
m_usingBaseProcessGroups = true;
std::vector<WorkspaceGroup_sptr> outGroups;
// ---------- Create all the output workspaces ----------------------------
for (auto &pureOutputWorkspaceProp : m_pureOutputWorkspaceProps) {
Property *prop = dynamic_cast<Property *>(pureOutputWorkspaceProp);
auto outWSGrp = boost::make_shared<WorkspaceGroup>();
outGroups.push_back(outWSGrp);
// Put the GROUP in the ADS
AnalysisDataService::Instance().addOrReplace(prop->value(), outWSGrp);
outWSGrp->observeADSNotifications(false);
}
Peterson, Peter
committed
double progress_proportion = 1.0 / static_cast<double>(m_groupSize);
// Go through each entry in the input group(s)
for (size_t entry = 0; entry < m_groupSize; entry++) {
// use create Child Algorithm that look like this one
Algorithm_sptr alg_sptr = this->createChildAlgorithm(
this->name(), progress_proportion * static_cast<double>(entry),
progress_proportion * (1 + static_cast<double>(entry)),
this->isLogging(), this->version());
// Don't make the new algorithm a child so that it's workspaces are stored
// correctly
alg_sptr->setChild(false);
alg_sptr->setRethrows(true);
IAlgorithm *alg = alg_sptr.get();
// Set all non-workspace properties
this->copyNonWorkspaceProperties(alg, int(entry) + 1);
std::string outputBaseName;
// ---------- Set all the input workspaces ----------------------------
for (size_t iwp = 0; iwp < m_groups.size(); iwp++) {
std::vector<Workspace_sptr> &thisGroup = m_groups[iwp];
if (!thisGroup.empty()) {
// By default (for a single group) point to the first/only workspace
Workspace_sptr ws = thisGroup[0];
if ((m_singleGroup == int(iwp)) || m_singleGroup < 0) {
// Either: this is the single group
// OR: all inputs are groups
// ... so get then entry^th workspace in this group
ws = thisGroup[entry];
// Append the names together
if (!outputBaseName.empty())
outputBaseName += "_";
outputBaseName += ws->getName();
// Set the property using the name of that workspace
Federico Montesino Pouzols
committed
if (Property *prop =
dynamic_cast<Property *>(m_inputWorkspaceProps[iwp])) {
alg->setPropertyValue(prop->name(), ws->getName());
Federico Montesino Pouzols
committed
throw std::logic_error("Found a Workspace property which doesn't "
"inherit from Property.");
} // not an empty (i.e. optional) input
} // for each InputWorkspace property
std::vector<std::string> outputWSNames(m_pureOutputWorkspaceProps.size());
// ---------- Set all the output workspaces ----------------------------
for (size_t owp = 0; owp < m_pureOutputWorkspaceProps.size(); owp++) {
if (Property *prop =
dynamic_cast<Property *>(m_pureOutputWorkspaceProps[owp])) {
// Default name = "in1_in2_out"
const std::string inName = prop->value();
std::string outName;
Hahn, Steven
committed
if (m_groupsHaveSimilarNames) {
outName.append(inName).append("_").append(
Strings::toString(entry + 1));
} else {
outName.append(outputBaseName).append("_").append(inName);
}
auto inputProp = std::find_if(m_inputWorkspaceProps.begin(),
m_inputWorkspaceProps.end(),
WorkspacePropertyValueIs(inName));
// Overwrite workspaces in any input property if they have the same
// name as an output (i.e. copy name button in algorithm dialog used)
// (only need to do this for a single input, multiple will be handled
// by ADS)
if (inputProp != m_inputWorkspaceProps.end()) {
const auto &inputGroup =
m_groups[inputProp - m_inputWorkspaceProps.begin()];
if (!inputGroup.empty())
outName = inputGroup[entry]->getName();
// Except if all inputs had similar names, then the name is "out_1"
// Set in the output
alg->setPropertyValue(prop->name(), outName);
outputWSNames[owp] = outName;
} else {
throw std::logic_error(
"Found a Workspace property which doesn't inherit from Property.");
}
} // for each OutputWorkspace property
// ------------ Execute the algo --------------
try {
alg->execute();
} catch (std::exception &e) {
std::ostringstream msg;
msg << "Execution of " << this->name() << " for group entry "
<< (entry + 1) << " failed: ";
msg << e.what(); // Add original message
throw std::runtime_error(msg.str());
Peterson, Peter
committed
// ------------ Fill in the output workspace group ------------------
// this has to be done after execute() because a workspace must exist
// when it is added to a group
for (size_t owp = 0; owp < m_pureOutputWorkspaceProps.size(); owp++) {
// And add it to the output group
outGroups[owp]->add(outputWSNames[owp]);
} // for each entry in each group
for (auto &outGroup : outGroups) {
outGroup->observeADSNotifications(true);
return true;
}
//--------------------------------------------------------------------------------------------
/** Copy all the non-workspace properties from this to alg
*
* @param alg :: other IAlgorithm
* @param periodNum :: number of the "period" = the entry in the group + 1
*/
void Algorithm::copyNonWorkspaceProperties(IAlgorithm *alg, int periodNum) {
if (!alg)
throw std::runtime_error("Algorithm not created!");
std::vector<Property *> props = this->getProperties();
for (auto prop : props) {
if (prop) {
IWorkspaceProperty *wsProp = dynamic_cast<IWorkspaceProperty *>(prop);
// Copy the property using the string
if (!wsProp)
this->setOtherProperties(alg, prop->name(), prop->value(), periodNum);
1432
1433
1434
1435
1436
1437
1438
1439
1440
1441
1442
1443
1444
1445
1446
1447
1448
1449
1450
1451
1452
1453
1454
}
}
//--------------------------------------------------------------------------------------------
/** Virtual method to set the non workspace properties for this algorithm.
* To be overridden by specific algorithms when needed.
*
* @param alg :: pointer to the algorithm
* @param propertyName :: name of the property
* @param propertyValue :: value of the property
* @param periodNum :: period number
*/
void Algorithm::setOtherProperties(IAlgorithm *alg,
const std::string &propertyName,
const std::string &propertyValue,
int periodNum) {
(void)periodNum; // Avoid compiler warning
if (alg)
alg->setPropertyValue(propertyName, propertyValue);
}
//--------------------------------------------------------------------------------------------
/** To query the property is a workspace property
* @param prop :: pointer to input properties
* @returns true if this is a workspace property
*/
bool Algorithm::isWorkspaceProperty(const Kernel::Property *const prop) const {
if (!prop) {
return false;
}
const IWorkspaceProperty *const wsProp =
dynamic_cast<const IWorkspaceProperty *>(prop);
return (wsProp != nullptr);
}
//=============================================================================================
//================================== Asynchronous Execution
//===================================
//=============================================================================================
namespace {
/**
* A object to set the flag marking asynchronous running correctly
*/
struct AsyncFlagHolder {
/** Constructor
* @param A :: reference to the running flag
*/
explicit AsyncFlagHolder(bool &running_flag) : m_running_flag(running_flag) {
m_running_flag = true;
}
/// Destructor
~AsyncFlagHolder() { m_running_flag = false; }
private:
/// Default constructor
AsyncFlagHolder();
/// Running flag
bool &m_running_flag;
};
} // namespace
//--------------------------------------------------------------------------------------------
/**
* Asynchronous execution
*/
Poco::ActiveResult<bool> Algorithm::executeAsync() {
m_executeAsync = new Poco::ActiveMethod<bool, Poco::Void, Algorithm>(
this, &Algorithm::executeAsyncImpl);
return (*m_executeAsync)(Poco::Void());
}
/**Callback when an algorithm is executed asynchronously
* @param i :: Unused argument
* @return true if executed successfully.
bool Algorithm::executeAsyncImpl(const Poco::Void &) {
AsyncFlagHolder running(m_runningAsync);
return this->execute();
}
/**
* @return A reference to the Poco::NotificationCenter object that dispatches
* notifications
*/
Poco::NotificationCenter &Algorithm::notificationCenter() const {
if (!m_notificationCenter)
m_notificationCenter = new Poco::NotificationCenter;
return *m_notificationCenter;
}
/** Handles and rescales child algorithm progress notifications.
* @param pNf :: The progress notification from the child algorithm.
*/
1525
1526
1527
1528
1529
1530
1531
1532
1533
1534
1535
1536
1537
1538
1539
1540
1541
1542
1543
1544
1545
1546
1547
1548
1549
1550
1551
1552
1553
void Algorithm::handleChildProgressNotification(
const Poco::AutoPtr<ProgressNotification> &pNf) {
double p = m_startChildProgress +
(m_endChildProgress - m_startChildProgress) * pNf->progress;
progress(p, pNf->message);
}
/**
* @return A Poco:NObserver object that is responsible for reporting progress
*/
const Poco::AbstractObserver &Algorithm::progressObserver() const {
if (!m_progressObserver)
m_progressObserver = new Poco::NObserver<Algorithm, ProgressNotification>(
*const_cast<Algorithm *>(this),
&Algorithm::handleChildProgressNotification);
return *m_progressObserver;
}
//--------------------------------------------------------------------------------------------
/**
* Cancel an algorithm
*/
void Algorithm::cancel() {
// set myself to be cancelled
m_cancel = true;
// Loop over the output workspaces and try to cancel them
for (auto &weakPtr : m_ChildAlgorithms) {
if (IAlgorithm_sptr sharedPtr = weakPtr.lock()) {
sharedPtr->cancel();
1561
1562
1563
1564
1565
1566
1567
1568
1569
1570
1571
1572
1573
1574
1575
1576
1577
1578
1579
1580
1581
1582
1583
1584
1585
1586
1587
1588
/// Returns the cancellation state
bool Algorithm::getCancel() const { return m_cancel; }
/// Returns a reference to the logger.
Kernel::Logger &Algorithm::getLogger() const { return g_log; }
/// Logging can be disabled by passing a value of false
void Algorithm::setLogging(const bool value) { g_log.setEnabled(value); }
/// returns the status of logging, True = enabled
bool Algorithm::isLogging() const { return g_log.getEnabled(); }
/* Sets the logging priority offset. Values are subtracted from the log level.
*
* Example value=1 will turn warning into notice
* Example value=-1 will turn notice into warning
*/
void Algorithm::setLoggingOffset(const int value) {
if (m_communicator->rank() == 0)
g_log.setLevelOffset(value);
else {
int offset{1};
ConfigService::Instance().getValue("mpi.loggingOffset", offset);
g_log.setLevelOffset(value + offset);
}
}
/// returns the logging priority offset
int Algorithm::getLoggingOffset() const { return g_log.getLevelOffset(); }
1589
1590
1591
1592
1593
1594
1595
1596
1597
1598
1599
1600
1601
1602
1603
1604
1605
1606
1607
1608
1609
1610
1611
1612
1613
1614
1615
//--------------------------------------------------------------------------------------------
/** This is called during long-running operations,
* and check if the algorithm has requested that it be cancelled.
*/
void Algorithm::interruption_point() {
// only throw exceptions if the code is not multi threaded otherwise you
// contravene the OpenMP standard
// that defines that all loops must complete, and no exception can leave an
// OpenMP section
// openmp cancel handling is performed using the ??, ?? and ?? macros in each
// algrothim
IF_NOT_PARALLEL
if (m_cancel)
throw CancelException();
}
/**
Report that the algorithm has completed.
@param duration : Algorithm duration
@param groupProcessing : We have been processing via processGroups if true.
*/
void Algorithm::reportCompleted(const double &duration,
const bool groupProcessing) {
std::string optionalMessage;
if (groupProcessing) {
optionalMessage = ". Processed as a workspace group";
}
Gigg, Martyn Anthony
committed
if (!m_isChildAlgorithm || m_alwaysStoreInADS) {
if (m_isAlgStartupLoggingEnabled) {
std::stringstream msg;
msg << name() << " successful, Duration ";
double seconds = duration;
if (seconds > 60.) {
int minutes = static_cast<int>(seconds / 60.);
msg << minutes << " minutes ";
seconds = seconds - static_cast<double>(minutes) * 60.;
}
msg << std::fixed << std::setprecision(2) << seconds << " seconds"
<< optionalMessage;
getLogger().notice(msg.str());
Gigg, Martyn Anthony
committed
else {
getLogger().debug() << name() << " finished with isChild = " << isChild()
}
m_running = false;
}
/** Registers the usage of the algorithm with the UsageService
void Algorithm::registerFeatureUsage() const {
std::ostringstream oss;
oss << this->name() << ".v" << this->version();
UsageService::Instance().registerFeatureUsage("Algorithm", oss.str(),
isChild());
/** Enable or disable Logging of start and end messages
@param enabled : true to enable logging, false to disable
*/
void Algorithm::setAlgStartupLogging(const bool enabled) {
m_isAlgStartupLoggingEnabled = enabled;
}
/** return the state of logging of start and end messages
@returns : true to logging is enabled
*/
bool Algorithm::getAlgStartupLogging() const {
return m_isAlgStartupLoggingEnabled;
}
bool Algorithm::isCompoundProperty(const std::string &name) const {
return std::find(m_reservedList.cbegin(), m_reservedList.cend(), name) !=
m_reservedList.cend();
}
/// Runs the algorithm with the specified execution mode.
void Algorithm::exec(Parallel::ExecutionMode executionMode) {
switch (executionMode) {
case Parallel::ExecutionMode::Serial:
case Parallel::ExecutionMode::Identical:
return exec();
case Parallel::ExecutionMode::Distributed:
return execDistributed();
case Parallel::ExecutionMode::MasterOnly:
return execMasterOnly();
default:
throw(std::runtime_error("Algorithm " + name() +
" does not support execution mode " +
Parallel::toString(executionMode)));
}
}
/** Runs the algorithm in `distributed` execution mode.
*
* The default implementation runs the normal exec() method on all ranks.
* Classes inheriting from Algorithm can re-implement this if they support
* execution with multiple MPI ranks and require a special implementation for
* distributed execution. */
void Algorithm::execDistributed() { exec(); }
/** Runs the algorithm in `master-only` execution mode.
*
* The default implementation runs the normal exec() method on rank 0 and
* execNonMaster() on all other ranks. Classes inheriting from Algorithm can
* re-implement this if they support execution with multiple MPI ranks and
* require a special implementation for master-only execution. */
void Algorithm::execMasterOnly() {
if (communicator().rank() == 0)
exec();
else
execNonMaster();
}
/** By default execMasterOnly() runs this in `master-only` execution mode on all
* but rank 0.
*
* The default implementation creates dummy workspaces for all pure output
* workspaces. Classes inheriting from Algorithm can re-implement this if they
* support execution with multiple MPI ranks and require a special behavior on
* non-master ranks in master-only execution. */
void Algorithm::execNonMaster() {
// If there is no output we can simply do nothing.
if (m_pureOutputWorkspaceProps.empty())
return;
// Does Algorithm have exactly one input and one output workspace property?
if (m_inputWorkspaceProps.size() == 1 &&
m_pureOutputWorkspaceProps.size() == 1) {
// Does the input workspace property point to an actual workspace?
if (const auto &ws = m_inputWorkspaceProps.front()->getWorkspace()) {
if (ws->storageMode() == Parallel::StorageMode::MasterOnly) {
const auto &wsProp = m_pureOutputWorkspaceProps.front();
// This is the reverse cast of what is done in
// cacheWorkspaceProperties(), so it should never fail.
const Property &prop = dynamic_cast<Property &>(*wsProp);
auto clone = ws->cloneEmpty();
// Currently we have not implemented a proper cloneEmpty() for all
// workspace types, in particular the abundance of Workspace2D subtypes,
// so we do a safety check here.
if (ws->storageMode() != clone->storageMode())
throw std::runtime_error(clone->id() +
"::cloneEmpty() did not return a workspace "
"with the correct storage mode. Make sure "
"cloneEmpty() sets the storage mode.");
setProperty(prop.name(), std::move(clone));
return;
}
}
throw std::runtime_error(
"Attempt to run algorithm with " +
Parallel::toString(Parallel::ExecutionMode::MasterOnly) +
": Execution in this mode not implemented.");
/** Get a (valid) execution mode for this algorithm.
*
* "Valid" implies that this function does check whether or not the Algorithm
* actually supports the mode. If it cannot return a valid mode it throws an
* error. As a consequence, the return value of this function can be used
* without further sanitization of the return value. */
Parallel::ExecutionMode Algorithm::getExecutionMode() const {
if (communicator().size() == 1)
return Parallel::ExecutionMode::Serial;
const auto storageModes = getInputWorkspaceStorageModes();
const auto executionMode = getParallelExecutionMode(storageModes);
if (executionMode == Parallel::ExecutionMode::Invalid) {
std::string error("Algorithm does not support execution with input "
"workspaces of the following storage types: " +
Parallel::toString(storageModes) + ".");
getLogger().error() << error << "\n";
throw(std::runtime_error(error));
}
if (executionMode == Parallel::ExecutionMode::Serial) {
std::string error(Parallel::toString(executionMode) +
" is not a valid *parallel* execution mode.");
getLogger().error() << error << "\n";
throw(std::runtime_error(error));
}
return executionMode;
}
/** Get map of storage modes of all input workspaces.
*
* The key to the name is the property name of the respective workspace. */
std::map<std::string, Parallel::StorageMode>
Algorithm::getInputWorkspaceStorageModes() const {
std::map<std::string, Parallel::StorageMode> map;
for (const auto &wsProp : m_inputWorkspaceProps) {
// This is the reverse cast of what is done in cacheWorkspaceProperties(),
// so it should never fail.
const Property &prop = dynamic_cast<Property &>(*wsProp);
// Check if we actually have that input workspace
if (wsProp->getWorkspace())
map.emplace(prop.name(), wsProp->getWorkspace()->storageMode());
}
return map;
}
/** Get correct execution mode based on input storage modes for an MPI run.
*
* The default implementation returns ExecutionMode::Invalid. Classes inheriting
* from Algorithm can re-implement this if they support execution with multiple
* MPI ranks. May not return ExecutionMode::Serial, because that is not a
* "parallel" execution mode. */
Parallel::ExecutionMode Algorithm::getParallelExecutionMode(
const std::map<std::string, Parallel::StorageMode> &storageModes) const {
UNUSED_ARG(storageModes)
// By default no parallel execution is possible.
return Parallel::ExecutionMode::Invalid;
}
/// Sets up skipping workspace validation on non-master ranks for
/// StorageMode::MasterOnly.
void Algorithm::setupSkipValidationMasterOnly() {
// If workspaces have StorageMode::MasterOnly, validation on non-master ranks
// would usually fail. Therefore, WorkspaceProperty needs to skip validation.
// Thus, we must notify it whether or not it is on the master rank or not.
if (communicator().rank() != 0)
for (auto *prop : getProperties())
if (auto *wsProp = dynamic_cast<IWorkspaceProperty *>(prop))
wsProp->setIsMasterRank(false);
}
/// Returns a const reference to the (MPI) communicator of the algorithm.
const Parallel::Communicator &Algorithm::communicator() const {
return *m_communicator;
}
/// Sets the (MPI) communicator of the algorithm.
void Algorithm::setCommunicator(const Parallel::Communicator &communicator) {
m_communicator = Kernel::make_unique<Parallel::Communicator>(communicator);
}
1830
1831
1832
1833
1834
1835
1836
1837
1838
1839
1840
1841
1842
1843
1844
1845
1846
1847
1848
1849
1850
1851
1852
1853
1854
1855
1856
1857
1858
1859
1860
1861
1862
1863
1864
1865
1866
1867
1868
1869
1870
1871
1872
1873
1874
1875
1876
//---------------------------------------------------------------------------
// Algorithm's inner classes
//---------------------------------------------------------------------------
Algorithm::AlgorithmNotification::AlgorithmNotification(
const Algorithm *const alg)
: Poco::Notification(), m_algorithm(alg) {}
const IAlgorithm *Algorithm::AlgorithmNotification::algorithm() const {
return m_algorithm;
}
Algorithm::StartedNotification::StartedNotification(const Algorithm *const alg)
: AlgorithmNotification(alg) {}
std::string Algorithm::StartedNotification::name() const {
return "StartedNotification";
} ///< class name
Algorithm::FinishedNotification::FinishedNotification(
const Algorithm *const alg, bool res)
: AlgorithmNotification(alg), success(res) {}
std::string Algorithm::FinishedNotification::name() const {
return "FinishedNotification";
}
Algorithm::ProgressNotification::ProgressNotification(
const Algorithm *const alg, double p, const std::string &msg,
double estimatedTime, int progressPrecision)
: AlgorithmNotification(alg), progress(p), message(msg),
estimatedTime(estimatedTime), progressPrecision(progressPrecision) {}
std::string Algorithm::ProgressNotification::name() const {
return "ProgressNotification";
}
Algorithm::ErrorNotification::ErrorNotification(const Algorithm *const alg,
const std::string &str)
: AlgorithmNotification(alg), what(str) {}
std::string Algorithm::ErrorNotification::name() const {
return "ErrorNotification";
}
const char *Algorithm::CancelException::what() const noexcept {
return "Algorithm terminated";
}
1877
1878
1879
1880
1881
1882
1883
1884
1885
1886
1887
1888
1889
1890
1891
1892
1893
1894
1895
1896
1897
1898
} // namespace API
//---------------------------------------------------------------------------
// Specialized templated PropertyManager getValue definitions for Algorithm
// types
//---------------------------------------------------------------------------
namespace Kernel {
/**
* Get the value of a given property as the declared concrete type
* @param name :: The name of the property
* @returns A pointer to an algorithm
*/
template <>
MANTID_API_DLL API::IAlgorithm_sptr
IPropertyManager::getValue<API::IAlgorithm_sptr>(
const std::string &name) const {
PropertyWithValue<API::IAlgorithm_sptr> *prop =
dynamic_cast<PropertyWithValue<API::IAlgorithm_sptr> *>(
getPointerToProperty(name));
if (prop) {
return *prop;
} else {
std::string message = "Attempt to assign property " + name +
" to incorrect type. Expected shared_ptr<IAlgorithm>";
1901
1902
1903
1904
1905
1906
1907
1908
1909
1910
1911
1912
1913
1914
1915
1916
1917
1918
1919
1920
1921
throw std::runtime_error(message);
}
}
/**
* Get the value of a given property as the declared concrete type (const
* version)
* @param name :: The name of the property
* @returns A pointer to an algorithm
*/
template <>
MANTID_API_DLL API::IAlgorithm_const_sptr
IPropertyManager::getValue<API::IAlgorithm_const_sptr>(
const std::string &name) const {
PropertyWithValue<API::IAlgorithm_sptr> *prop =
dynamic_cast<PropertyWithValue<API::IAlgorithm_sptr> *>(
getPointerToProperty(name));
if (prop) {
return prop->operator()();
} else {
std::string message =
"Attempt to assign property " + name +
" to incorrect type. Expected const shared_ptr<IAlgorithm>";
throw std::runtime_error(message);
Gigg, Martyn Anthony
committed
}
} // namespace Kernel
Gigg, Martyn Anthony
committed
Peterson, Peter
committed
} // namespace Mantid