| 1 |
/* |
| 2 |
* Copyright (C) 2013-2015, 2019 by the Konclude Developer Team. |
| 3 |
* |
| 4 |
* This file is part of the reasoning system Konclude. |
| 5 |
* For details and support, see <http://konclude.com/>. |
| 6 |
* |
| 7 |
* Konclude is free software: you can redistribute it and/or modify |
| 8 |
* it under the terms of version 3 of the GNU Lesser General Public |
| 9 |
* License (LGPLv3) as published by the Free Software Foundation. |
| 10 |
* |
| 11 |
* Konclude is distributed in the hope that it will be useful, |
| 12 |
* but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 13 |
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
| 14 |
* GNU (Lesser) General Public License for more details. |
| 15 |
* |
| 16 |
* You should have received a copy of the GNU (Lesser) General Public |
| 17 |
* License along with Konclude. If not, see <http://www.gnu.org/licenses/>. |
| 18 |
* |
| 19 |
*/ |
| 20 |
|
| 21 |
#include "CSatisfiableCalculationTaskStatusPropagator.h" |
| 22 |
|
| 23 |
|
| 24 |
namespace Konclude { |
| 25 |
|
| 26 |
namespace Reasoner { |
| 27 |
|
| 28 |
namespace Kernel { |
| 29 |
|
| 30 |
namespace Task { |
| 31 |
|
| 32 |
CSatisfiableCalculationTaskStatusPropagator::CSatisfiableCalculationTaskStatusPropagator() { |
| 33 |
} |
| 34 |
|
| 35 |
|
| 36 |
CSatisfiableCalculationTaskStatusPropagator::~CSatisfiableCalculationTaskStatusPropagator() { |
| 37 |
} |
| 38 |
|
| 39 |
|
| 40 |
bool CSatisfiableCalculationTaskStatusPropagator::updateTaskStatus(CTask* task, bool& moreDownPropagation, bool& moreUpPropagation) { |
| 41 |
CSatisfiableCalculationTask* satCalcTask = (CSatisfiableCalculationTask*)task; |
| 42 |
CTaskStatus* taskStatus = satCalcTask->getTaskStatus(); |
| 43 |
|
| 44 |
|
| 45 |
if (taskStatus->isProcessable() || taskStatus->isError()) { |
| 46 |
|
| 47 |
bool cancelTasks = false; |
| 48 |
|
| 49 |
|
| 50 |
CBooleanTaskResult* taskResult = satCalcTask->getSatisfiableCalculationTaskResult(); |
| 51 |
if (taskResult->hasResult() && !taskResult->getResultValue()) { |
| 52 |
cancelTasks = true; |
| 53 |
} |
| 54 |
|
| 55 |
CSatisfiableCalculationTask* parentTask = (CSatisfiableCalculationTask*)satCalcTask->getParentTask(); |
| 56 |
if (parentTask && !cancelTasks) { |
| 57 |
CBooleanTaskResult* parentTaskResult = parentTask->getSatisfiableCalculationTaskResult(); |
| 58 |
CTaskStatus* parentTaskStatus = parentTask->getTaskStatus(); |
| 59 |
if (parentTaskStatus->isError() || parentTaskStatus->isCanceled() || (parentTaskResult->hasResult() && parentTaskResult->getResultValue())) { |
| 60 |
cancelTasks = true; |
| 61 |
} |
| 62 |
} |
| 63 |
|
| 64 |
|
| 65 |
if (cancelTasks) { |
| 66 |
taskStatus->setCanceled(true); |
| 67 |
moreDownPropagation = true; |
| 68 |
return true; |
| 69 |
} else { |
| 70 |
|
| 71 |
if (taskStatus->isError()) { |
| 72 |
if (parentTask) { |
| 73 |
parentTask->getTaskStatus()->setError(true,taskStatus->getErrorCode()); |
| 74 |
} |
| 75 |
moreDownPropagation = true; |
| 76 |
return true; |
| 77 |
|
| 78 |
} else if (taskResult->hasResult() && taskResult->getResultValue()) { |
| 79 |
taskStatus->setFinished(true); |
| 80 |
|
| 81 |
if (parentTask) { |
| 82 |
CBooleanTaskResult* parentTaskResult = parentTask->getSatisfiableCalculationTaskResult(); |
| 83 |
if (!parentTaskResult->hasResult()) { |
| 84 |
parentTaskResult->installResult(true); |
| 85 |
moreUpPropagation = true; |
| 86 |
} |
| 87 |
} |
| 88 |
|
| 89 |
moreDownPropagation = true; |
| 90 |
return true; |
| 91 |
} |
| 92 |
} |
| 93 |
} |
| 94 |
return false; |
| 95 |
} |
| 96 |
|
| 97 |
bool CSatisfiableCalculationTaskStatusPropagator::completeTaskStatus(CTask* task, bool& moreUpPropagation) { |
| 98 |
CSatisfiableCalculationTask* satCalcTask = (CSatisfiableCalculationTask*)task; |
| 99 |
CBooleanTaskResult* taskResult = satCalcTask->getSatisfiableCalculationTaskResult(); |
| 100 |
CTaskStatus* taskStatus = satCalcTask->getTaskStatus(); |
| 101 |
if (taskStatus->isProcessable() || taskStatus->isError()) { |
| 102 |
if (taskStatus->isError()) { |
| 103 |
CTask* parentTask = satCalcTask->getParentTask(); |
| 104 |
if (parentTask && !parentTask->getTaskStatus()->isError()) { |
| 105 |
parentTask->getTaskStatus()->setError(true,taskStatus->getErrorCode()); |
| 106 |
moreUpPropagation = true; |
| 107 |
return true; |
| 108 |
} |
| 109 |
} else if (taskResult->hasResult()) { |
| 110 |
taskStatus->setFinished(true); |
| 111 |
if (taskResult->getResultValue()) { |
| 112 |
CSatisfiableCalculationTask* parentTask = (CSatisfiableCalculationTask*)satCalcTask->getParentTask(); |
| 113 |
if (parentTask) { |
| 114 |
CBooleanTaskResult* parentTaskResult = parentTask->getSatisfiableCalculationTaskResult(); |
| 115 |
if (!parentTaskResult->hasResult()) { |
| 116 |
parentTaskResult->installResult(true); |
| 117 |
moreUpPropagation = true; |
| 118 |
} |
| 119 |
} |
| 120 |
} |
| 121 |
} else { |
| 122 |
taskResult->installResult(false); |
| 123 |
taskStatus->setFinished(true); |
| 124 |
} |
| 125 |
return true; |
| 126 |
} |
| 127 |
return false; |
| 128 |
} |
| 129 |
|
| 130 |
|
| 131 |
|
| 132 |
}; // end namespace Task |
| 133 |
|
| 134 |
}; // end namespace Kernel |
| 135 |
|
| 136 |
}; // end namespace Reasoner |
| 137 |
|
| 138 |
}; // end namespace Konclude |