mirror of
https://github.com/SerenityOS/serenity
synced 2024-09-06 17:06:31 +00:00
390666b9fa
For security critical code we need to have some way of performing constant time buffer comparisons.
80 lines
2.9 KiB
C++
80 lines
2.9 KiB
C++
/*
|
|
* Copyright (c) 2020-2022, the SerenityOS developers.
|
|
*
|
|
* SPDX-License-Identifier: BSD-2-Clause
|
|
*/
|
|
|
|
#include <LibTest/TestCase.h>
|
|
|
|
#include <AK/MemMem.h>
|
|
#include <AK/Memory.h>
|
|
#include <AK/String.h>
|
|
|
|
TEST_CASE(bitap)
|
|
{
|
|
Array<u8, 8> haystack { 1, 0, 1, 2, 3, 4, 5, 0 };
|
|
Array<u8, 4> needle_0 { 2, 3, 4, 5 };
|
|
Array<u8, 4> needle_1 { 1, 2, 3, 4 };
|
|
Array<u8, 4> needle_2 { 3, 4, 5, 0 };
|
|
Array<u8, 4> needle_3 { 3, 4, 5, 6 };
|
|
|
|
auto result_0 = AK::memmem(haystack.data(), haystack.size(), needle_0.data(), needle_0.size());
|
|
auto result_1 = AK::memmem(haystack.data(), haystack.size(), needle_1.data(), needle_1.size());
|
|
auto result_2 = AK::memmem(haystack.data(), haystack.size(), needle_2.data(), needle_2.size());
|
|
auto result_3 = AK::memmem(haystack.data(), haystack.size(), needle_3.data(), needle_3.size());
|
|
|
|
EXPECT_EQ(result_0, &haystack[3]);
|
|
EXPECT_EQ(result_1, &haystack[2]);
|
|
EXPECT_EQ(result_2, &haystack[4]);
|
|
EXPECT_EQ(result_3, nullptr);
|
|
}
|
|
|
|
TEST_CASE(kmp_one_chunk)
|
|
{
|
|
Array<u8, 8> haystack { 1, 0, 1, 2, 3, 4, 5, 0 };
|
|
Array<Array<u8, 8>, 1> haystack_arr { haystack };
|
|
Array<u8, 4> needle_0 { 2, 3, 4, 5 };
|
|
Array<u8, 4> needle_1 { 1, 2, 3, 4 };
|
|
Array<u8, 4> needle_2 { 3, 4, 5, 0 };
|
|
Array<u8, 4> needle_3 { 3, 4, 5, 6 };
|
|
|
|
auto result_0 = AK::memmem(haystack_arr.begin(), haystack_arr.end(), needle_0);
|
|
auto result_1 = AK::memmem(haystack_arr.begin(), haystack_arr.end(), needle_1);
|
|
auto result_2 = AK::memmem(haystack_arr.begin(), haystack_arr.end(), needle_2);
|
|
auto result_3 = AK::memmem(haystack_arr.begin(), haystack_arr.end(), needle_3);
|
|
|
|
EXPECT_EQ(result_0.value_or(9), 3u);
|
|
EXPECT_EQ(result_1.value_or(9), 2u);
|
|
EXPECT_EQ(result_2.value_or(9), 4u);
|
|
EXPECT(!result_3.has_value());
|
|
}
|
|
|
|
TEST_CASE(kmp_two_chunks)
|
|
{
|
|
Array<u8, 4> haystack_first_half { 1, 0, 1, 2 }, haystack_second_half { 3, 4, 5, 0 };
|
|
Array<Array<u8, 4>, 2> haystack { haystack_first_half, haystack_second_half };
|
|
Array<u8, 4> needle_0 { 2, 3, 4, 5 };
|
|
Array<u8, 4> needle_1 { 1, 2, 3, 4 };
|
|
Array<u8, 4> needle_2 { 3, 4, 5, 0 };
|
|
Array<u8, 4> needle_3 { 3, 4, 5, 6 };
|
|
|
|
auto result_0 = AK::memmem(haystack.begin(), haystack.end(), needle_0);
|
|
auto result_1 = AK::memmem(haystack.begin(), haystack.end(), needle_1);
|
|
auto result_2 = AK::memmem(haystack.begin(), haystack.end(), needle_2);
|
|
auto result_3 = AK::memmem(haystack.begin(), haystack.end(), needle_3);
|
|
|
|
EXPECT_EQ(result_0.value_or(9), 3u);
|
|
EXPECT_EQ(result_1.value_or(9), 2u);
|
|
EXPECT_EQ(result_2.value_or(9), 4u);
|
|
EXPECT(!result_3.has_value());
|
|
}
|
|
|
|
TEST_CASE(timing_safe_compare)
|
|
{
|
|
String data_set = "abcdefghijklmnopqrstuvwxyz123456789";
|
|
EXPECT_EQ(true, AK::timing_safe_compare(data_set.characters(), data_set.characters(), data_set.length()));
|
|
|
|
String reversed = data_set.reverse();
|
|
EXPECT_EQ(false, AK::timing_safe_compare(data_set.characters(), reversed.characters(), reversed.length()));
|
|
}
|