mirror of
https://github.com/owasp-modsecurity/ModSecurity.git
synced 2025-08-14 05:45:59 +03:00
400 lines
13 KiB
C++
400 lines
13 KiB
C++
/*
|
|
* ModSecurity, http://www.modsecurity.org/
|
|
* Copyright (c) 2015 Trustwave Holdings, Inc. (http://www.trustwave.com/)
|
|
*
|
|
* You may not use this file except in compliance with
|
|
* the License. You may obtain a copy of the License at
|
|
*
|
|
* http://www.apache.org/licenses/LICENSE-2.0
|
|
*
|
|
* If any of the files related to licensing are missing or if you have any
|
|
* other questions related to licensing please contact Trustwave Holdings, Inc.
|
|
* directly using the email address security@modsecurity.org.
|
|
*
|
|
*/
|
|
|
|
|
|
#include <stdio.h>
|
|
|
|
#include <algorithm>
|
|
#include <iostream>
|
|
#include <string>
|
|
#include <cstring>
|
|
#include <list>
|
|
#include <utility>
|
|
#include <memory>
|
|
|
|
#include "modsecurity/rules_set.h"
|
|
#include "src/operators/operator.h"
|
|
#include "modsecurity/actions/action.h"
|
|
#include "modsecurity/modsecurity.h"
|
|
#include "src/actions/transformations/none.h"
|
|
#include "src/actions/tag.h"
|
|
#include "src/utils/string.h"
|
|
#include "modsecurity/rule_message.h"
|
|
#include "src/actions/msg.h"
|
|
#include "src/actions/log_data.h"
|
|
#include "src/actions/severity.h"
|
|
#include "src/actions/capture.h"
|
|
#include "src/actions/multi_match.h"
|
|
#include "src/actions/set_var.h"
|
|
#include "src/actions/block.h"
|
|
#include "src/variables/variable.h"
|
|
#include "src/rule_with_operator.h"
|
|
|
|
|
|
namespace modsecurity {
|
|
|
|
using operators::Operator;
|
|
using actions::Action;
|
|
using variables::Variable;
|
|
using actions::transformations::None;
|
|
|
|
|
|
RuleWithOperator::RuleWithOperator(Operator *op,
|
|
variables::Variables *_variables,
|
|
std::vector<Action *> *actions,
|
|
Transformations *transformations,
|
|
std::unique_ptr<std::string> fileName,
|
|
int lineNumber)
|
|
: RuleWithActions(actions, transformations, std::move(fileName), lineNumber),
|
|
m_variables(std::unique_ptr<variables::Variables>(_variables)),
|
|
m_operator(std::unique_ptr<Operator>(op)) { /* */ }
|
|
|
|
|
|
|
|
|
|
RuleWithOperator::~RuleWithOperator() {
|
|
}
|
|
|
|
|
|
void RuleWithOperator::updateMatchedVars(Transaction *trans, const std::string &key,
|
|
const std::string &value) {
|
|
ms_dbg_a(trans, 9, "Matched vars updated.");
|
|
trans->m_variableMatchedVar.set(value, trans->m_variableOffset);
|
|
trans->m_variableMatchedVarName.set(key, trans->m_variableOffset);
|
|
|
|
trans->m_variableMatchedVars.set(key, value, trans->m_variableOffset);
|
|
trans->m_variableMatchedVarsNames.set(key, key, trans->m_variableOffset);
|
|
}
|
|
|
|
|
|
void RuleWithOperator::cleanMatchedVars(Transaction *trans) {
|
|
ms_dbg_a(trans, 9, "Matched vars cleaned.");
|
|
trans->m_variableMatchedVar.unset();
|
|
trans->m_variableMatchedVars.unset();
|
|
trans->m_variableMatchedVarName.unset();
|
|
trans->m_variableMatchedVarsNames.unset();
|
|
}
|
|
|
|
|
|
|
|
bool RuleWithOperator::executeOperatorAt(Transaction *trans, const std::string &key,
|
|
std::string value) {
|
|
#if MSC_EXEC_CLOCK_ENABLED
|
|
clock_t begin = clock();
|
|
clock_t end;
|
|
double elapsed_s = 0;
|
|
#endif
|
|
bool ret;
|
|
|
|
ms_dbg_a(trans, 9, "Target value: \"" + utils::string::limitTo(80,
|
|
utils::string::toHexIfNeeded(value)) \
|
|
+ "\" (Variable: " + key + ")");
|
|
|
|
ret = m_operator->evaluateInternal(trans, this, value, trans->messageGetLast());
|
|
|
|
if (ret == false) {
|
|
return false;
|
|
}
|
|
|
|
#if MSC_EXEC_CLOCK_ENABLED
|
|
end = clock();
|
|
elapsed_s = static_cast<double>(end - begin) / CLOCKS_PER_SEC;
|
|
|
|
ms_dbg_a(trans, 5, "Operator completed in " + \
|
|
std::to_string(elapsed_s) + " seconds");
|
|
#endif
|
|
return ret;
|
|
}
|
|
|
|
|
|
void RuleWithOperator::getVariablesExceptions(Transaction *t,
|
|
variables::Variables *exclusion, variables::Variables *addition) {
|
|
for (auto &a : t->m_rules->m_exceptions.m_variable_update_target_by_tag) {
|
|
if (containsTag(*a.first.get(), t) == false) {
|
|
continue;
|
|
}
|
|
Variable *b = a.second.get();
|
|
if (dynamic_cast<variables::VariableModificatorExclusion*>(b)) {
|
|
exclusion->push_back(
|
|
dynamic_cast<variables::VariableModificatorExclusion*>(
|
|
b)->m_base.get());
|
|
} else {
|
|
addition->push_back(b);
|
|
}
|
|
}
|
|
|
|
for (auto &a : t->m_rules->m_exceptions.m_variable_update_target_by_msg) {
|
|
if (containsMsg(*a.first.get(), t) == false) {
|
|
continue;
|
|
}
|
|
Variable *b = a.second.get();
|
|
if (dynamic_cast<variables::VariableModificatorExclusion*>(b)) {
|
|
exclusion->push_back(
|
|
dynamic_cast<variables::VariableModificatorExclusion*>(
|
|
b)->m_base.get());
|
|
} else {
|
|
addition->push_back(b);
|
|
}
|
|
}
|
|
|
|
for (auto &a : t->m_rules->m_exceptions.m_variable_update_target_by_id) {
|
|
if (getId() != a.first) {
|
|
continue;
|
|
}
|
|
Variable *b = a.second.get();
|
|
if (dynamic_cast<variables::VariableModificatorExclusion*>(b)) {
|
|
exclusion->push_back(
|
|
dynamic_cast<variables::VariableModificatorExclusion*>(
|
|
b)->m_base.get());
|
|
} else {
|
|
addition->push_back(b);
|
|
}
|
|
}
|
|
}
|
|
|
|
|
|
inline void RuleWithOperator::getFinalVars(variables::Variables *vars,
|
|
variables::Variables *exclusion, Transaction *trans) {
|
|
variables::Variables addition;
|
|
getVariablesExceptions(trans, exclusion, &addition);
|
|
|
|
for (int i = 0; i < m_variables->size(); i++) {
|
|
Variable *variable = m_variables->at(i);
|
|
if (exclusion->contains(variable)) {
|
|
continue;
|
|
}
|
|
if (std::find_if(trans->m_ruleRemoveTargetById.begin(),
|
|
trans->m_ruleRemoveTargetById.end(),
|
|
[&, variable, this](std::pair<int, std::string> &m) -> bool {
|
|
return m.first == getId()
|
|
&& m.second == *variable->m_fullName.get();
|
|
}) != trans->m_ruleRemoveTargetById.end()) {
|
|
continue;
|
|
}
|
|
if (std::find_if(trans->m_ruleRemoveTargetByTag.begin(),
|
|
trans->m_ruleRemoveTargetByTag.end(),
|
|
[&, variable, trans, this](
|
|
std::pair<std::string, std::string> &m) -> bool {
|
|
return containsTag(m.first, trans)
|
|
&& m.second == *variable->m_fullName.get();
|
|
}) != trans->m_ruleRemoveTargetByTag.end()) {
|
|
continue;
|
|
}
|
|
vars->push_back(variable);
|
|
}
|
|
|
|
for (int i = 0; i < addition.size(); i++) {
|
|
Variable *variable = addition.at(i);
|
|
vars->push_back(variable);
|
|
}
|
|
}
|
|
|
|
|
|
bool RuleWithOperator::evaluate(Transaction *trans) {
|
|
bool globalRet = false;
|
|
variables::Variables *variables = m_variables.get();
|
|
bool recursiveGlobalRet;
|
|
bool containsBlock = hasBlockAction();
|
|
std::string eparam;
|
|
variables::Variables vars;
|
|
vars.reserve(4);
|
|
variables::Variables exclusion;
|
|
|
|
RuleWithActions::evaluate(trans);
|
|
|
|
// FIXME: Make a class runTimeException to handle this cases.
|
|
for (auto &i : trans->m_ruleRemoveById) {
|
|
if (getId() != i) {
|
|
continue;
|
|
}
|
|
ms_dbg_a(trans, 9, "Rule id: " + std::to_string(getId()) +
|
|
" was skipped due to a ruleRemoveById action...");
|
|
return true;
|
|
}
|
|
for (auto &i : trans->m_ruleRemoveByIdRange) {
|
|
if (!(i.first <= getId() && i.second >= getId())) {
|
|
continue;
|
|
}
|
|
ms_dbg_a(trans, 9, "Rule id: " + std::to_string(getId()) +
|
|
" was skipped due to a ruleRemoveById action...");
|
|
return true;
|
|
}
|
|
|
|
if (m_operator->m_string) {
|
|
eparam = m_operator->m_string->evaluate(trans);
|
|
|
|
if (m_operator->m_string->containsMacro()) {
|
|
eparam = "\"" + eparam + "\" Was: \"" \
|
|
+ m_operator->m_string->evaluate(NULL) + "\"";
|
|
} else {
|
|
eparam = "\"" + eparam + "\"";
|
|
}
|
|
ms_dbg_a(trans, 4, "(Rule: " + std::to_string(getId()) \
|
|
+ ") Executing operator \"" + getOperatorName() \
|
|
+ "\" with param " \
|
|
+ eparam \
|
|
+ " against " \
|
|
+ variables + ".");
|
|
} else {
|
|
ms_dbg_a(trans, 4, "(Rule: " + std::to_string(getId()
|
|
) \
|
|
+ ") Executing operator \"" + getOperatorName() \
|
|
+ " against " \
|
|
+ variables + ".");
|
|
}
|
|
|
|
|
|
getFinalVars(&vars, &exclusion, trans);
|
|
|
|
for (auto &var : vars) {
|
|
std::vector<const VariableValue *> e;
|
|
if (!var) {
|
|
continue;
|
|
}
|
|
var->evaluate(trans, this, &e);
|
|
for (const VariableValue *v : e) {
|
|
TransformationsResults transformationsResults;
|
|
const std::string &value = v->getValue();
|
|
const std::string &key = v->getKeyWithCollection();
|
|
|
|
if (exclusion.contains(v) ||
|
|
std::find_if(trans->m_ruleRemoveTargetById.begin(),
|
|
trans->m_ruleRemoveTargetById.end(),
|
|
[&, v, this](std::pair<int, std::string> &m) -> bool {
|
|
return m.first == getId() && m.second == v->getKeyWithCollection();
|
|
}) != trans->m_ruleRemoveTargetById.end()
|
|
) {
|
|
delete v;
|
|
v = NULL;
|
|
continue;
|
|
}
|
|
if (exclusion.contains(v) ||
|
|
std::find_if(trans->m_ruleRemoveTargetByTag.begin(),
|
|
trans->m_ruleRemoveTargetByTag.end(),
|
|
[&, v, trans, this](std::pair<std::string, std::string> &m) -> bool {
|
|
return containsTag(m.first, trans) && m.second == v->getKeyWithCollection();
|
|
}) != trans->m_ruleRemoveTargetByTag.end()
|
|
) {
|
|
delete v;
|
|
v = NULL;
|
|
continue;
|
|
}
|
|
|
|
executeTransformations(trans, value, transformationsResults);
|
|
|
|
auto iter = transformationsResults.begin();
|
|
if (!hasMultimatchAction()) {
|
|
iter = transformationsResults.end();
|
|
std::advance(iter, -1);
|
|
}
|
|
while (iter != transformationsResults.end()) {
|
|
bool ret;
|
|
auto &valueTemp = *iter;
|
|
// FIXME: this copy is not necessary.
|
|
std::string *valueAfterTrans = new std::string(valueTemp.getAfter()->c_str(), valueTemp.getAfter()->size());
|
|
|
|
ret = executeOperatorAt(trans, key, *valueAfterTrans);
|
|
|
|
if (ret == true) {
|
|
trans->messageGetLast()->m_match = m_operator->resolveMatchMessage(trans,
|
|
key, value);
|
|
|
|
for (auto &i : v->getOrigin()) {
|
|
trans->messageGetLast()->m_reference.append(i->toText());
|
|
}
|
|
|
|
auto iter2 = transformationsResults.begin();
|
|
while (iter2 != transformationsResults.end()) {
|
|
if (iter2->getTransformationName()) {
|
|
trans->messageGetLast()->m_reference.append(*iter2->getTransformationName());
|
|
}
|
|
/*
|
|
if (iter == iter2) {
|
|
break;
|
|
} else if (iter2->getTransformationName()) {
|
|
trans->messageGetLast()->m_reference.append(",");
|
|
}
|
|
*/
|
|
iter2++;
|
|
}
|
|
|
|
updateMatchedVars(trans, key, *valueAfterTrans);
|
|
executeActionsIndependentOfChainedRuleResult(trans);
|
|
|
|
globalRet = true;
|
|
}
|
|
delete valueAfterTrans;
|
|
iter++;
|
|
}
|
|
delete v;
|
|
v = NULL;
|
|
}
|
|
e.clear();
|
|
e.reserve(4);
|
|
}
|
|
|
|
if (globalRet == false) {
|
|
ms_dbg_a(trans, 4, "Rule returned 0.");
|
|
cleanMatchedVars(trans);
|
|
goto end_clean;
|
|
}
|
|
ms_dbg_a(trans, 4, "Rule returned 1.");
|
|
|
|
if (this->hasChainAction() == false) {
|
|
goto end_exec;
|
|
}
|
|
|
|
/* FIXME: this check should happens on the parser. */
|
|
if (getChainedNext() == nullptr) {
|
|
ms_dbg_a(trans, 4, "Rule is marked as chained but there " \
|
|
"isn't a subsequent rule.");
|
|
goto end_clean;
|
|
}
|
|
|
|
ms_dbg_a(trans, 4, "Executing chained rule.");
|
|
recursiveGlobalRet = getChainedNext()->evaluate(trans);
|
|
|
|
if (recursiveGlobalRet == true) {
|
|
goto end_exec;
|
|
}
|
|
|
|
end_clean:
|
|
return false;
|
|
|
|
end_exec:
|
|
executeActionsAfterFullMatch(trans);
|
|
|
|
/* last rule in the chain. */
|
|
trans->logMatchLastRuleOnTheChain(this);
|
|
|
|
if (hasSeverityAction()) {
|
|
ms_dbg_a(trans, 9, "This rule severity is: " + \
|
|
std::to_string(getSeverity()) + " current transaction is: " + \
|
|
std::to_string(trans->m_highestSeverityAction));
|
|
|
|
if (trans->m_highestSeverityAction > getSeverity()) {
|
|
trans->m_highestSeverityAction = getSeverity();
|
|
}
|
|
}
|
|
|
|
return true;
|
|
}
|
|
|
|
|
|
std::string RuleWithOperator::getOperatorName() const { return m_operator->m_op; }
|
|
|
|
|
|
} // namespace modsecurity
|