mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-11-23 03:02:36 +01:00
538ee6c38c
Running `-fsyntax-only` on UniqueID.h is 2x faster with this patch (which avoids calling `std::tie` for `operator<`). Since the transitive includers of this file will go up as `FileEntryRef` gets used in more places, avoid that compile-time hit. This is a follow-up to 23ed570af1cc165afea1b70a533a4a39d6656501 (suggested by Reid Kleckner). Also drop the `<tuple>` include from FileSystem.h (which was vestigal from before UniqueID.h was split out). Differential Revision: https://reviews.llvm.org/D90471
39 lines
1.2 KiB
C++
39 lines
1.2 KiB
C++
//===- llvm/unittest/Support/FSUniqueIDTest.cpp - Test sys::fs::UniqueID --===//
|
|
//
|
|
// 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 "llvm/Support/FileSystem/UniqueID.h"
|
|
#include "gtest/gtest.h"
|
|
|
|
using namespace llvm;
|
|
using namespace llvm::sys::fs;
|
|
|
|
namespace {
|
|
|
|
TEST(FSUniqueIDTest, construct) {
|
|
EXPECT_EQ(20u, UniqueID(20, 10).getDevice());
|
|
EXPECT_EQ(10u, UniqueID(20, 10).getFile());
|
|
}
|
|
|
|
TEST(FSUniqueIDTest, equals) {
|
|
EXPECT_TRUE(UniqueID(20, 10) == UniqueID(20, 10));
|
|
EXPECT_FALSE(UniqueID(20, 20) == UniqueID(20, 10));
|
|
EXPECT_FALSE(UniqueID(10, 10) == UniqueID(20, 10));
|
|
}
|
|
|
|
TEST(FSUniqueIDTest, less) {
|
|
EXPECT_FALSE(UniqueID(20, 2) < UniqueID(20, 2));
|
|
EXPECT_FALSE(UniqueID(20, 3) < UniqueID(20, 2));
|
|
EXPECT_FALSE(UniqueID(30, 2) < UniqueID(20, 2));
|
|
EXPECT_FALSE(UniqueID(30, 2) < UniqueID(20, 40));
|
|
EXPECT_TRUE(UniqueID(20, 2) < UniqueID(20, 3));
|
|
EXPECT_TRUE(UniqueID(20, 2) < UniqueID(30, 2));
|
|
EXPECT_TRUE(UniqueID(20, 40) < UniqueID(30, 2));
|
|
}
|
|
|
|
} // anonymous namespace
|