mirror of
https://github.com/apple/swift.git
synced 2025-12-14 20:36:38 +01:00
f3ff561c6f
This is phase-1 of switching from llvm::Optional to std::optional in the
next rebranch. llvm::Optional was removed from upstream LLVM, so we need
to migrate off rather soon. On Darwin, std::optional, and llvm::Optional
have the same layout, so we don't need to be as concerned about ABI
beyond the name mangling. `llvm::Optional` is only returned from one
function in
```
getStandardTypeSubst(StringRef TypeName,
bool allowConcurrencyManglings);
```
It's the return value, so it should not impact the mangling of the
function, and the layout is the same as `std::optional`, so it should be
mostly okay. This function doesn't appear to have users, and the ABI was
already broken 2 years ago for concurrency and no one seemed to notice
so this should be "okay".
I'm doing the migration incrementally so that folks working on main can
cherry-pick back to the release/5.9 branch. Once 5.9 is done and locked
away, then we can go through and finish the replacement. Since `None`
and `Optional` show up in contexts where they are not `llvm::None` and
`llvm::Optional`, I'm preparing the work now by going through and
removing the namespace unwrapping and making the `llvm` namespace
explicit. This should make it fairly mechanical to go through and
replace llvm::Optional with std::optional, and llvm::None with
std::nullopt. It's also a change that can be brought onto the
release/5.9 with minimal impact. This should be an NFC change.
130 lines
4.8 KiB
C++
130 lines
4.8 KiB
C++
//===--- ImmutablePointerSetTest.cpp --------------------------------------===//
|
|
//
|
|
// This source file is part of the Swift.org open source project
|
|
//
|
|
// Copyright (c) 2014 - 2017 Apple Inc. and the Swift project authors
|
|
// Licensed under Apache License v2.0 with Runtime Library Exception
|
|
//
|
|
// See https://swift.org/LICENSE.txt for license information
|
|
// See https://swift.org/CONTRIBUTORS.txt for the list of Swift project authors
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#include "swift/Basic/ImmutablePointerSet.h"
|
|
#include "llvm/ADT/ArrayRef.h"
|
|
#include "llvm/Support/Allocator.h"
|
|
#include "gtest/gtest.h"
|
|
|
|
using namespace swift;
|
|
|
|
TEST(ImmutableSortedSet, OneElementSets) {
|
|
llvm::BumpPtrAllocator BPA;
|
|
ImmutablePointerSetFactory<unsigned> F(BPA);
|
|
|
|
unsigned *ptr1 = (unsigned *)3;
|
|
auto *OneEltSet1 = F.get(ptr1);
|
|
EXPECT_EQ(OneEltSet1, F.get(ptr1));
|
|
EXPECT_EQ(OneEltSet1, F.merge(OneEltSet1, OneEltSet1));
|
|
|
|
unsigned *ptr2 = (unsigned *)2;
|
|
auto *OneEltSet2 = F.get(ptr2);
|
|
EXPECT_EQ(OneEltSet2, F.get(ptr2));
|
|
EXPECT_EQ(OneEltSet2, F.merge(OneEltSet2, OneEltSet2));
|
|
EXPECT_NE(OneEltSet2, OneEltSet1);
|
|
|
|
auto *Merge1 = F.merge(OneEltSet1, OneEltSet2);
|
|
auto *Merge2 = F.merge(OneEltSet2, OneEltSet1);
|
|
EXPECT_NE(OneEltSet1, Merge1);
|
|
EXPECT_NE(OneEltSet2, Merge1);
|
|
EXPECT_EQ(Merge1, Merge2);
|
|
EXPECT_EQ(Merge1, F.merge(Merge1, Merge1));
|
|
EXPECT_EQ(Merge2, F.merge(Merge2, Merge2));
|
|
EXPECT_EQ(Merge1, F.merge(Merge1, OneEltSet1));
|
|
EXPECT_EQ(Merge1, F.merge(Merge1, OneEltSet2));
|
|
|
|
EXPECT_EQ(Merge1->size(), 2U);
|
|
EXPECT_FALSE(Merge1->empty());
|
|
EXPECT_EQ(*Merge1->begin(), (unsigned *)2);
|
|
EXPECT_EQ(*std::next(Merge1->begin()), (unsigned *)3);
|
|
|
|
EXPECT_EQ(F.getEmptySet(), F.getEmptySet());
|
|
EXPECT_EQ(OneEltSet1, F.merge(F.getEmptySet(), OneEltSet1));
|
|
EXPECT_EQ(OneEltSet1, F.merge(OneEltSet1, F.getEmptySet()));
|
|
}
|
|
|
|
TEST(ImmutablePointerSet, MultipleElementSets) {
|
|
llvm::BumpPtrAllocator BPA;
|
|
ImmutablePointerSetFactory<unsigned> F(BPA);
|
|
|
|
unsigned *Ptr1 = (unsigned *)3;
|
|
unsigned *Ptr2 = (unsigned *)4;
|
|
unsigned *Ptr3 = (unsigned *)3;
|
|
unsigned *Ptr4 = (unsigned *)5;
|
|
unsigned *Ptr5 = (unsigned *)6;
|
|
llvm::SmallVector<unsigned *, 2> Data1 = {Ptr1, Ptr2};
|
|
|
|
auto *TwoEltSet = F.get(Data1);
|
|
EXPECT_FALSE(TwoEltSet->empty());
|
|
EXPECT_EQ(TwoEltSet->size(), 2u);
|
|
EXPECT_TRUE(TwoEltSet->count(Ptr1));
|
|
EXPECT_TRUE(TwoEltSet->count(Ptr2));
|
|
EXPECT_TRUE(TwoEltSet->count(Ptr3));
|
|
EXPECT_FALSE(TwoEltSet->count(Ptr4));
|
|
EXPECT_FALSE(TwoEltSet->count(Ptr5));
|
|
|
|
auto *ThreeEltSet = F.merge(F.get(Ptr4), TwoEltSet);
|
|
EXPECT_FALSE(ThreeEltSet->empty());
|
|
EXPECT_EQ(ThreeEltSet->size(), 3u);
|
|
EXPECT_NE(*ThreeEltSet, *TwoEltSet);
|
|
EXPECT_TRUE(ThreeEltSet->count(Ptr1));
|
|
EXPECT_TRUE(ThreeEltSet->count(Ptr2));
|
|
EXPECT_TRUE(ThreeEltSet->count(Ptr3));
|
|
EXPECT_TRUE(ThreeEltSet->count(Ptr4));
|
|
EXPECT_FALSE(ThreeEltSet->count(Ptr5));
|
|
EXPECT_EQ(ThreeEltSet, F.merge(TwoEltSet, ThreeEltSet));
|
|
|
|
llvm::SmallVector<unsigned *, 3> Data2 = {Ptr3, Ptr4, Ptr5};
|
|
auto *PartialOverlapSet = F.get(Data2);
|
|
EXPECT_FALSE(PartialOverlapSet->empty());
|
|
EXPECT_EQ(PartialOverlapSet->size(), 3u);
|
|
EXPECT_TRUE(PartialOverlapSet->count(Ptr1));
|
|
EXPECT_FALSE(PartialOverlapSet->count(Ptr2));
|
|
EXPECT_TRUE(PartialOverlapSet->count(Ptr3));
|
|
EXPECT_TRUE(PartialOverlapSet->count(Ptr4));
|
|
EXPECT_TRUE(PartialOverlapSet->count(Ptr5));
|
|
EXPECT_NE(*PartialOverlapSet, *ThreeEltSet);
|
|
EXPECT_NE(*PartialOverlapSet, *TwoEltSet);
|
|
|
|
auto *MixOfThreeAndPartialOverlap = ThreeEltSet->merge(PartialOverlapSet);
|
|
EXPECT_FALSE(MixOfThreeAndPartialOverlap->empty());
|
|
EXPECT_EQ(MixOfThreeAndPartialOverlap->size(), 4u);
|
|
EXPECT_TRUE(MixOfThreeAndPartialOverlap->count(Ptr1));
|
|
EXPECT_TRUE(MixOfThreeAndPartialOverlap->count(Ptr2));
|
|
EXPECT_TRUE(MixOfThreeAndPartialOverlap->count(Ptr3));
|
|
EXPECT_TRUE(MixOfThreeAndPartialOverlap->count(Ptr4));
|
|
EXPECT_TRUE(MixOfThreeAndPartialOverlap->count(Ptr5));
|
|
EXPECT_NE(*MixOfThreeAndPartialOverlap, *PartialOverlapSet);
|
|
EXPECT_NE(*MixOfThreeAndPartialOverlap, *ThreeEltSet);
|
|
EXPECT_NE(*MixOfThreeAndPartialOverlap, *TwoEltSet);
|
|
}
|
|
|
|
TEST(ImmutablePointerSet, EmptyIntersectionTests) {
|
|
llvm::BumpPtrAllocator BPA;
|
|
ImmutablePointerSetFactory<unsigned> F(BPA);
|
|
|
|
unsigned *Ptr1 = (unsigned *)3;
|
|
unsigned *Ptr2 = (unsigned *)4;
|
|
unsigned *Ptr3 = (unsigned *)3;
|
|
unsigned *Ptr4 = (unsigned *)5;
|
|
unsigned *Ptr5 = (unsigned *)6;
|
|
|
|
llvm::SmallVector<unsigned *, 2> Data1 = {Ptr1, Ptr2};
|
|
llvm::SmallVector<unsigned *, 2> Data2 = {Ptr3, Ptr2};
|
|
llvm::SmallVector<unsigned *, 2> Data3 = {Ptr4, Ptr5};
|
|
llvm::SmallVector<unsigned *, 2> Data4 = {Ptr2, Ptr4};
|
|
|
|
EXPECT_FALSE(F.get(Data1)->hasEmptyIntersection(F.get(Data2)));
|
|
EXPECT_TRUE(F.get(Data1)->hasEmptyIntersection(F.get(Data3)));
|
|
EXPECT_FALSE(F.get(Data1)->hasEmptyIntersection(F.get(Data4)));
|
|
}
|