mirror of
https://github.com/RPCS3/llvm.git
synced 2024-12-14 15:39:06 +00:00
e86c615970
I'm working on a lower-level intrusive list that can be used stand-alone, and splitting the files up a bit will make the code easier to organize. Explode the ilist headers in advance to improve blame lists in the future. - Move ilist_node_base from ilist_node.h to ilist_node_base.h. - Move ilist_base from ilist.h to ilist_base.h. - Move ilist_iterator from ilist.h to ilist_iterator.h. - Move ilist_node_access from ilist.h to ilist_node.h to support ilist_iterator. - Update unit tests to #include smaller headers. - Clang-format the moved things. I noticed in transit that there is a simplify_type specialization for ilist_iterator. Since there is no longer an implicit conversion from ilist<T>::iterator to T*, this doesn't make sense (effectively it's a form of implicit conversion). For now I've added a FIXME. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@280047 91177308-0d34-0410-b5e6-96231b3b80d8
103 lines
2.5 KiB
C++
103 lines
2.5 KiB
C++
//===- unittests/ADT/IListBaseTest.cpp - ilist_base unit tests ------------===//
|
|
//
|
|
// The LLVM Compiler Infrastructure
|
|
//
|
|
// This file is distributed under the University of Illinois Open Source
|
|
// License. See LICENSE.TXT for details.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#include "llvm/ADT/ilist_base.h"
|
|
#include "gtest/gtest.h"
|
|
|
|
using namespace llvm;
|
|
|
|
namespace {
|
|
|
|
TEST(IListBaseTest, insertBeforeImpl) {
|
|
ilist_node_base S, A, B;
|
|
// [S] <-> [S]
|
|
S.setPrev(&S);
|
|
S.setNext(&S);
|
|
|
|
// [S] <-> A <-> [S]
|
|
ilist_base::insertBeforeImpl(S, A);
|
|
EXPECT_EQ(&A, S.getPrev());
|
|
EXPECT_EQ(&S, A.getPrev());
|
|
EXPECT_EQ(&A, S.getNext());
|
|
EXPECT_EQ(&S, A.getNext());
|
|
|
|
// [S] <-> A <-> B <-> [S]
|
|
ilist_base::insertBeforeImpl(S, B);
|
|
EXPECT_EQ(&B, S.getPrev());
|
|
EXPECT_EQ(&A, B.getPrev());
|
|
EXPECT_EQ(&S, A.getPrev());
|
|
EXPECT_EQ(&A, S.getNext());
|
|
EXPECT_EQ(&B, A.getNext());
|
|
EXPECT_EQ(&S, B.getNext());
|
|
}
|
|
|
|
TEST(IListBaseTest, removeImpl) {
|
|
ilist_node_base S, A, B;
|
|
|
|
// [S] <-> A <-> B <-> [S]
|
|
S.setPrev(&S);
|
|
S.setNext(&S);
|
|
ilist_base::insertBeforeImpl(S, A);
|
|
ilist_base::insertBeforeImpl(S, B);
|
|
|
|
// [S] <-> B <-> [S]
|
|
ilist_base::removeImpl(A);
|
|
EXPECT_EQ(&B, S.getPrev());
|
|
EXPECT_EQ(&S, B.getPrev());
|
|
EXPECT_EQ(&B, S.getNext());
|
|
EXPECT_EQ(&S, B.getNext());
|
|
EXPECT_EQ(nullptr, A.getPrev());
|
|
EXPECT_EQ(nullptr, A.getNext());
|
|
|
|
// [S] <-> [S]
|
|
ilist_base::removeImpl(B);
|
|
EXPECT_EQ(&S, S.getPrev());
|
|
EXPECT_EQ(&S, S.getNext());
|
|
EXPECT_EQ(nullptr, B.getPrev());
|
|
EXPECT_EQ(nullptr, B.getNext());
|
|
}
|
|
|
|
TEST(IListBaseTest, transferBeforeImpl) {
|
|
ilist_node_base S1, S2, A, B, C, D, E;
|
|
|
|
// [S1] <-> A <-> B <-> C <-> [S1]
|
|
S1.setPrev(&S1);
|
|
S1.setNext(&S1);
|
|
ilist_base::insertBeforeImpl(S1, A);
|
|
ilist_base::insertBeforeImpl(S1, B);
|
|
ilist_base::insertBeforeImpl(S1, C);
|
|
|
|
// [S2] <-> D <-> E <-> [S2]
|
|
S2.setPrev(&S2);
|
|
S2.setNext(&S2);
|
|
ilist_base::insertBeforeImpl(S2, D);
|
|
ilist_base::insertBeforeImpl(S2, E);
|
|
|
|
// [S1] <-> C <-> [S1]
|
|
ilist_base::transferBeforeImpl(D, A, C);
|
|
EXPECT_EQ(&C, S1.getPrev());
|
|
EXPECT_EQ(&S1, C.getPrev());
|
|
EXPECT_EQ(&C, S1.getNext());
|
|
EXPECT_EQ(&S1, C.getNext());
|
|
|
|
// [S2] <-> A <-> B <-> D <-> E <-> [S2]
|
|
EXPECT_EQ(&E, S2.getPrev());
|
|
EXPECT_EQ(&D, E.getPrev());
|
|
EXPECT_EQ(&B, D.getPrev());
|
|
EXPECT_EQ(&A, B.getPrev());
|
|
EXPECT_EQ(&S2, A.getPrev());
|
|
EXPECT_EQ(&A, S2.getNext());
|
|
EXPECT_EQ(&B, A.getNext());
|
|
EXPECT_EQ(&D, B.getNext());
|
|
EXPECT_EQ(&E, D.getNext());
|
|
EXPECT_EQ(&S2, E.getNext());
|
|
}
|
|
|
|
} // end namespace
|