mirror of
https://github.com/owasp-modsecurity/ModSecurity.git
synced 2025-08-15 23:55:03 +03:00
169 lines
4.9 KiB
C++
169 lines
4.9 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 "src/actions/transformations/js_decode.h"
|
|
|
|
#include <string.h>
|
|
|
|
#include <iostream>
|
|
#include <string>
|
|
#include <algorithm>
|
|
#include <functional>
|
|
#include <cctype>
|
|
#include <locale>
|
|
|
|
#include "modsecurity/transaction.h"
|
|
#include "src/actions/transformations/transformation.h"
|
|
#include "src/utils/string.h"
|
|
|
|
|
|
namespace modsecurity {
|
|
namespace actions {
|
|
namespace transformations {
|
|
|
|
|
|
std::string JsDecode::evaluate(std::string value,
|
|
Transaction *transaction) {
|
|
std::string ret;
|
|
unsigned char *input = NULL;
|
|
|
|
input = reinterpret_cast<unsigned char *>
|
|
(malloc(sizeof(char) * value.length()+1));
|
|
|
|
if (input == NULL) {
|
|
return "";
|
|
}
|
|
|
|
memcpy(input, value.c_str(), value.length()+1);
|
|
|
|
size_t i = inplace(input, value.length());
|
|
|
|
ret.assign(reinterpret_cast<char *>(input), i);
|
|
free(input);
|
|
|
|
return ret;
|
|
}
|
|
|
|
|
|
int JsDecode::inplace(unsigned char *input, u_int64_t input_len) {
|
|
unsigned char *d = (unsigned char *)input;
|
|
int64_t i, count;
|
|
|
|
i = count = 0;
|
|
while (i < input_len) {
|
|
if (input[i] == '\\') {
|
|
/* Character is an escape. */
|
|
|
|
if ((i + 5 < input_len) && (input[i + 1] == 'u')
|
|
&& (VALID_HEX(input[i + 2])) && (VALID_HEX(input[i + 3]))
|
|
&& (VALID_HEX(input[i + 4])) && (VALID_HEX(input[i + 5]))) {
|
|
/* \uHHHH */
|
|
|
|
/* Use only the lower byte. */
|
|
*d = utils::string::x2c(&input[i + 4]);
|
|
|
|
/* Full width ASCII (ff01 - ff5e) needs 0x20 added */
|
|
if ((*d > 0x00) && (*d < 0x5f)
|
|
&& ((input[i + 2] == 'f') || (input[i + 2] == 'F'))
|
|
&& ((input[i + 3] == 'f') || (input[i + 3] == 'F'))) {
|
|
(*d) += 0x20;
|
|
}
|
|
|
|
d++;
|
|
count++;
|
|
i += 6;
|
|
} else if ((i + 3 < input_len) && (input[i + 1] == 'x')
|
|
&& VALID_HEX(input[i + 2]) && VALID_HEX(input[i + 3])) {
|
|
/* \xHH */
|
|
*d++ = utils::string::x2c(&input[i + 2]);
|
|
count++;
|
|
i += 4;
|
|
} else if ((i + 1 < input_len) && ISODIGIT(input[i + 1])) {
|
|
/* \OOO (only one byte, \000 - \377) */
|
|
char buf[4];
|
|
int j = 0;
|
|
|
|
while ((i + 1 + j < input_len) && (j < 3)) {
|
|
buf[j] = input[i + 1 + j];
|
|
j++;
|
|
if (!ISODIGIT(input[i + 1 + j])) break;
|
|
}
|
|
buf[j] = '\0';
|
|
|
|
if (j > 0) {
|
|
/* Do not use 3 characters if we will be > 1 byte */
|
|
if ((j == 3) && (buf[0] > '3')) {
|
|
j = 2;
|
|
buf[j] = '\0';
|
|
}
|
|
*d++ = (unsigned char)strtol(buf, NULL, 8);
|
|
i += 1 + j;
|
|
count++;
|
|
}
|
|
} else if (i + 1 < input_len) {
|
|
/* \C */
|
|
unsigned char c = input[i + 1];
|
|
switch (input[i + 1]) {
|
|
case 'a' :
|
|
c = '\a';
|
|
break;
|
|
case 'b' :
|
|
c = '\b';
|
|
break;
|
|
case 'f' :
|
|
c = '\f';
|
|
break;
|
|
case 'n' :
|
|
c = '\n';
|
|
break;
|
|
case 'r' :
|
|
c = '\r';
|
|
break;
|
|
case 't' :
|
|
c = '\t';
|
|
break;
|
|
case 'v' :
|
|
c = '\v';
|
|
break;
|
|
/* The remaining (\?,\\,\',\") are just a removal
|
|
* of the escape char which is default.
|
|
*/
|
|
}
|
|
|
|
*d++ = c;
|
|
i += 2;
|
|
count++;
|
|
} else {
|
|
/* Not enough bytes */
|
|
while (i < input_len) {
|
|
*d++ = input[i++];
|
|
count++;
|
|
}
|
|
}
|
|
} else {
|
|
*d++ = input[i++];
|
|
count++;
|
|
}
|
|
}
|
|
|
|
*d = '\0';
|
|
|
|
return count;
|
|
}
|
|
|
|
} // namespace transformations
|
|
} // namespace actions
|
|
} // namespace modsecurity
|