forked from OSchip/llvm-project
213 lines
4.4 KiB
C++
213 lines
4.4 KiB
C++
//===-- list_test.cpp -------------------------------------------*- C++ -*-===//
|
|
//
|
|
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
|
|
// See https://llvm.org/LICENSE.txt for license information.
|
|
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#include "tests/scudo_unit_test.h"
|
|
|
|
#include "list.h"
|
|
|
|
struct ListItem {
|
|
ListItem *Next;
|
|
ListItem *Prev;
|
|
};
|
|
|
|
static ListItem Items[6];
|
|
static ListItem *X = &Items[0];
|
|
static ListItem *Y = &Items[1];
|
|
static ListItem *Z = &Items[2];
|
|
static ListItem *A = &Items[3];
|
|
static ListItem *B = &Items[4];
|
|
static ListItem *C = &Items[5];
|
|
|
|
typedef scudo::SinglyLinkedList<ListItem> SLList;
|
|
typedef scudo::DoublyLinkedList<ListItem> DLList;
|
|
|
|
template <typename ListT>
|
|
static void setList(ListT *L, ListItem *I1 = nullptr, ListItem *I2 = nullptr,
|
|
ListItem *I3 = nullptr) {
|
|
L->clear();
|
|
if (I1)
|
|
L->push_back(I1);
|
|
if (I2)
|
|
L->push_back(I2);
|
|
if (I3)
|
|
L->push_back(I3);
|
|
}
|
|
|
|
template <typename ListT>
|
|
static void checkList(ListT *L, ListItem *I1, ListItem *I2 = nullptr,
|
|
ListItem *I3 = nullptr, ListItem *I4 = nullptr,
|
|
ListItem *I5 = nullptr, ListItem *I6 = nullptr) {
|
|
if (I1) {
|
|
EXPECT_EQ(L->front(), I1);
|
|
L->pop_front();
|
|
}
|
|
if (I2) {
|
|
EXPECT_EQ(L->front(), I2);
|
|
L->pop_front();
|
|
}
|
|
if (I3) {
|
|
EXPECT_EQ(L->front(), I3);
|
|
L->pop_front();
|
|
}
|
|
if (I4) {
|
|
EXPECT_EQ(L->front(), I4);
|
|
L->pop_front();
|
|
}
|
|
if (I5) {
|
|
EXPECT_EQ(L->front(), I5);
|
|
L->pop_front();
|
|
}
|
|
if (I6) {
|
|
EXPECT_EQ(L->front(), I6);
|
|
L->pop_front();
|
|
}
|
|
EXPECT_TRUE(L->empty());
|
|
}
|
|
|
|
template <typename ListT> static void testListCommon(void) {
|
|
ListT L;
|
|
L.clear();
|
|
|
|
EXPECT_EQ(L.size(), 0U);
|
|
L.push_back(X);
|
|
EXPECT_EQ(L.size(), 1U);
|
|
EXPECT_EQ(L.back(), X);
|
|
EXPECT_EQ(L.front(), X);
|
|
L.pop_front();
|
|
EXPECT_TRUE(L.empty());
|
|
L.checkConsistency();
|
|
|
|
L.push_front(X);
|
|
EXPECT_EQ(L.size(), 1U);
|
|
EXPECT_EQ(L.back(), X);
|
|
EXPECT_EQ(L.front(), X);
|
|
L.pop_front();
|
|
EXPECT_TRUE(L.empty());
|
|
L.checkConsistency();
|
|
|
|
L.push_front(X);
|
|
L.push_front(Y);
|
|
L.push_front(Z);
|
|
EXPECT_EQ(L.size(), 3U);
|
|
EXPECT_EQ(L.front(), Z);
|
|
EXPECT_EQ(L.back(), X);
|
|
L.checkConsistency();
|
|
|
|
L.pop_front();
|
|
EXPECT_EQ(L.size(), 2U);
|
|
EXPECT_EQ(L.front(), Y);
|
|
EXPECT_EQ(L.back(), X);
|
|
L.pop_front();
|
|
L.pop_front();
|
|
EXPECT_TRUE(L.empty());
|
|
L.checkConsistency();
|
|
|
|
L.push_back(X);
|
|
L.push_back(Y);
|
|
L.push_back(Z);
|
|
EXPECT_EQ(L.size(), 3U);
|
|
EXPECT_EQ(L.front(), X);
|
|
EXPECT_EQ(L.back(), Z);
|
|
L.checkConsistency();
|
|
|
|
L.pop_front();
|
|
EXPECT_EQ(L.size(), 2U);
|
|
EXPECT_EQ(L.front(), Y);
|
|
EXPECT_EQ(L.back(), Z);
|
|
L.pop_front();
|
|
L.pop_front();
|
|
EXPECT_TRUE(L.empty());
|
|
L.checkConsistency();
|
|
}
|
|
|
|
TEST(ScudoListTest, LinkedListCommon) {
|
|
testListCommon<SLList>();
|
|
testListCommon<DLList>();
|
|
}
|
|
|
|
TEST(ScudoListTest, SinglyLinkedList) {
|
|
SLList L;
|
|
L.clear();
|
|
|
|
L.push_back(X);
|
|
L.push_back(Y);
|
|
L.push_back(Z);
|
|
L.extract(X, Y);
|
|
EXPECT_EQ(L.size(), 2U);
|
|
EXPECT_EQ(L.front(), X);
|
|
EXPECT_EQ(L.back(), Z);
|
|
L.checkConsistency();
|
|
L.extract(X, Z);
|
|
EXPECT_EQ(L.size(), 1U);
|
|
EXPECT_EQ(L.front(), X);
|
|
EXPECT_EQ(L.back(), X);
|
|
L.checkConsistency();
|
|
L.pop_front();
|
|
EXPECT_TRUE(L.empty());
|
|
|
|
SLList L1, L2;
|
|
L1.clear();
|
|
L2.clear();
|
|
|
|
L1.append_back(&L2);
|
|
EXPECT_TRUE(L1.empty());
|
|
EXPECT_TRUE(L2.empty());
|
|
|
|
setList(&L1, X);
|
|
checkList(&L1, X);
|
|
|
|
setList(&L1, X, Y, Z);
|
|
setList(&L2, A, B, C);
|
|
L1.append_back(&L2);
|
|
checkList(&L1, X, Y, Z, A, B, C);
|
|
EXPECT_TRUE(L2.empty());
|
|
|
|
L1.clear();
|
|
L2.clear();
|
|
L1.push_back(X);
|
|
L1.append_back(&L2);
|
|
EXPECT_EQ(L1.back(), X);
|
|
EXPECT_EQ(L1.front(), X);
|
|
EXPECT_EQ(L1.size(), 1U);
|
|
}
|
|
|
|
TEST(ScudoListTest, DoublyLinkedList) {
|
|
DLList L;
|
|
L.clear();
|
|
|
|
L.push_back(X);
|
|
L.push_back(Y);
|
|
L.push_back(Z);
|
|
L.remove(Y);
|
|
EXPECT_EQ(L.size(), 2U);
|
|
EXPECT_EQ(L.front(), X);
|
|
EXPECT_EQ(L.back(), Z);
|
|
L.checkConsistency();
|
|
L.remove(Z);
|
|
EXPECT_EQ(L.size(), 1U);
|
|
EXPECT_EQ(L.front(), X);
|
|
EXPECT_EQ(L.back(), X);
|
|
L.checkConsistency();
|
|
L.pop_front();
|
|
EXPECT_TRUE(L.empty());
|
|
|
|
L.push_back(X);
|
|
L.insert(Y, X);
|
|
EXPECT_EQ(L.size(), 2U);
|
|
EXPECT_EQ(L.front(), Y);
|
|
EXPECT_EQ(L.back(), X);
|
|
L.checkConsistency();
|
|
L.remove(Y);
|
|
EXPECT_EQ(L.size(), 1U);
|
|
EXPECT_EQ(L.front(), X);
|
|
EXPECT_EQ(L.back(), X);
|
|
L.checkConsistency();
|
|
L.pop_front();
|
|
EXPECT_TRUE(L.empty());
|
|
}
|