[NFC][ADT] Rename StringMapEntry *Create() into StringMapEntry *create.

diff --git a/llvm/include/llvm/ADT/StringMap.h b/llvm/include/llvm/ADT/StringMap.h
index eda82b4..0849bef 100644 (file)
--- a/llvm/include/llvm/ADT/StringMap.h
+++ b/llvm/include/llvm/ADT/StringMap.h
@@ -155,7 +155,7 @@ public:
         continue;
       }
 
-      TheTable[I] = MapEntryTy::Create(
+      TheTable[I] = MapEntryTy::create(
           static_cast<MapEntryTy *>(Bucket)->getKey(), getAllocator(),
           static_cast<MapEntryTy *>(Bucket)->getValue());
       HashTable[I] = RHSHashTable[I];
@@ -336,7 +336,7 @@ public:
     if (Bucket == getTombstoneVal())
       --NumTombstones;
     Bucket =
-        MapEntryTy::Create(Key, getAllocator(), std::forward<ArgsTy>(Args)...);
+        MapEntryTy::create(Key, getAllocator(), std::forward<ArgsTy>(Args)...);
     ++NumItems;
     assert(NumItems + NumTombstones <= NumBuckets);
 

diff --git a/llvm/include/llvm/ADT/StringMapEntry.h b/llvm/include/llvm/ADT/StringMapEntry.h
index b5fc6d5..98b51cc 100644 (file)
--- a/llvm/include/llvm/ADT/StringMapEntry.h
+++ b/llvm/include/llvm/ADT/StringMapEntry.h
@@ -123,7 +123,7 @@ public:
   /// Create a StringMapEntry for the specified key construct the value using
   /// \p InitiVals.
   template <typename AllocatorTy, typename... InitTy>
-  static StringMapEntry *Create(StringRef key, AllocatorTy &allocator,
+  static StringMapEntry *create(StringRef key, AllocatorTy &allocator,
                                 InitTy &&...initVals) {
     return new (StringMapEntryBase::allocateWithKey(
         sizeof(StringMapEntry), alignof(StringMapEntry), key, allocator))

diff --git a/llvm/include/llvm/DebugInfo/LogicalView/Core/LVStringPool.h b/llvm/include/llvm/DebugInfo/LogicalView/Core/LVStringPool.h
index 3733c6c..671ccf5 100644 (file)
--- a/llvm/include/llvm/DebugInfo/LogicalView/Core/LVStringPool.h
+++ b/llvm/include/llvm/DebugInfo/LogicalView/Core/LVStringPool.h
@@ -60,7 +60,7 @@ public:
     if (isValidIndex(Index))
       return Index;
     size_t Value = Entries.size();
-    ValueType *Entry = ValueType::Create(Key, Allocator, std::move(Value));
+    ValueType *Entry = ValueType::create(Key, Allocator, std::move(Value));
     StringTable.insert(Entry);
     Entries.push_back(Entry);
     return Value;

diff --git a/llvm/lib/IR/Value.cpp b/llvm/lib/IR/Value.cpp
index 4faf1ab..6dc7af9 100644 (file)
--- a/llvm/lib/IR/Value.cpp
+++ b/llvm/lib/IR/Value.cpp
@@ -352,7 +352,7 @@ void Value::setNameImpl(const Twine &NewName) {
 
     // Create the new name.
     MallocAllocator Allocator;
-    setValueName(ValueName::Create(NameRef, Allocator));
+    setValueName(ValueName::create(NameRef, Allocator));
     getValueName()->setValue(this);
     return;
   }

diff --git a/llvm/unittests/ADT/StringMapTest.cpp b/llvm/unittests/ADT/StringMapTest.cpp
index 415d7f6..f40f22a 100644 (file)
--- a/llvm/unittests/ADT/StringMapTest.cpp
+++ b/llvm/unittests/ADT/StringMapTest.cpp
@@ -236,7 +236,7 @@ TEST_F(StringMapTest, IterationTest) {
 TEST_F(StringMapTest, StringMapEntryTest) {
   MallocAllocator Allocator;
   StringMap<uint32_t>::value_type *entry =
-      StringMap<uint32_t>::value_type::Create(
+      StringMap<uint32_t>::value_type::create(
           StringRef(testKeyFirst, testKeyLength), Allocator, 1u);
   EXPECT_STREQ(testKey, entry->first().data());
   EXPECT_EQ(1u, entry->second);
@@ -246,7 +246,7 @@ TEST_F(StringMapTest, StringMapEntryTest) {
 // Test insert() method.
 TEST_F(StringMapTest, InsertTest) {
   SCOPED_TRACE("InsertTest");
-  testMap.insert(StringMap<uint32_t>::value_type::Create(
+  testMap.insert(StringMap<uint32_t>::value_type::create(
       StringRef(testKeyFirst, testKeyLength), testMap.getAllocator(), 1u));
   assertSingleItemMap();
 }
@@ -376,14 +376,14 @@ TEST_F(StringMapTest, MoveOnly) {
   StringMap<MoveOnly> t;
   t.insert(std::make_pair("Test", MoveOnly(42)));
   StringRef Key = "Test";
-  StringMapEntry<MoveOnly>::Create(Key, t.getAllocator(), MoveOnly(42))
+  StringMapEntry<MoveOnly>::create(Key, t.getAllocator(), MoveOnly(42))
       ->Destroy(t.getAllocator());
 }
 
 TEST_F(StringMapTest, CtorArg) {
   StringRef Key = "Test";
   MallocAllocator Allocator;
-  StringMapEntry<MoveOnly>::Create(Key, Allocator, Immovable())
+  StringMapEntry<MoveOnly>::create(Key, Allocator, Immovable())
       ->Destroy(Allocator);
 }
 

diff --git a/llvm/unittests/ADT/StringSetTest.cpp b/llvm/unittests/ADT/StringSetTest.cpp
index 4133149..e3703f6 100644 (file)
--- a/llvm/unittests/ADT/StringSetTest.cpp
+++ b/llvm/unittests/ADT/StringSetTest.cpp
@@ -35,7 +35,7 @@ TEST_F(StringSetTest, InsertAndCountStringMapEntry) {
   // which are required for set_difference(StringSet, StringSet).
   StringSet<> Set;
   StringMapEntry<StringRef> *Element =
-      StringMapEntry<StringRef>::Create("A", Set.getAllocator());
+      StringMapEntry<StringRef>::create("A", Set.getAllocator());
   Set.insert(*Element);
   size_t Count = Set.count(*Element);
   size_t Expected = 1;

diff --git a/llvm/unittests/CodeGen/DwarfStringPoolEntryRefTest.cpp b/llvm/unittests/CodeGen/DwarfStringPoolEntryRefTest.cpp
index 623ac4e..6e901f7 100644 (file)
--- a/llvm/unittests/CodeGen/DwarfStringPoolEntryRefTest.cpp
+++ b/llvm/unittests/CodeGen/DwarfStringPoolEntryRefTest.cpp
@@ -19,7 +19,7 @@ using namespace llvm;
 TEST(DwarfStringPoolEntryRefTest, TestFullEntry) {
   BumpPtrAllocator Allocator;
   StringMapEntry<DwarfStringPoolEntry> *StringEntry1 =
-      StringMapEntry<DwarfStringPoolEntry>::Create(
+      StringMapEntry<DwarfStringPoolEntry>::create(
           "Key1", Allocator, DwarfStringPoolEntry{nullptr, 0, 0});
 
   EXPECT_TRUE(StringEntry1->getKey() == "Key1");
@@ -40,7 +40,7 @@ TEST(DwarfStringPoolEntryRefTest, TestFullEntry) {
   EXPECT_FALSE(Ref1 != Ref2);
 
   StringMapEntry<DwarfStringPoolEntry> *StringEntry2 =
-      StringMapEntry<DwarfStringPoolEntry>::Create(
+      StringMapEntry<DwarfStringPoolEntry>::create(
           "Key2", Allocator, DwarfStringPoolEntry{nullptr, 0x1000, 1});
   EXPECT_TRUE(StringEntry2->getKey() == "Key2");
   EXPECT_TRUE(StringEntry2->second.Symbol == nullptr);
@@ -64,7 +64,7 @@ TEST(DwarfStringPoolEntryRefTest, TestShortEntry) {
   BumpPtrAllocator Allocator;
   DwarfStringPoolEntry DwarfEntry1 = {nullptr, 0, 0};
   StringMapEntry<DwarfStringPoolEntry *> *StringEntry1 =
-      StringMapEntry<DwarfStringPoolEntry *>::Create("Key1", Allocator,
+      StringMapEntry<DwarfStringPoolEntry *>::create("Key1", Allocator,
                                                      &DwarfEntry1);
 
   EXPECT_TRUE(StringEntry1->getKey() == "Key1");
@@ -87,7 +87,7 @@ TEST(DwarfStringPoolEntryRefTest, TestShortEntry) {
 
   DwarfStringPoolEntry DwarfEntry2 = {nullptr, 0x1000, 1};
   StringMapEntry<DwarfStringPoolEntry *> *StringEntry2 =
-      StringMapEntry<DwarfStringPoolEntry *>::Create("Key2", Allocator,
+      StringMapEntry<DwarfStringPoolEntry *>::create("Key2", Allocator,
                                                      &DwarfEntry2);
   EXPECT_TRUE(StringEntry2->getKey() == "Key2");
   EXPECT_TRUE(StringEntry2->second->Symbol == nullptr);
@@ -107,12 +107,12 @@ TEST(DwarfStringPoolEntryRefTest, CompareFullAndShort) {
 
   DwarfStringPoolEntry DwarfEntry1 = {nullptr, 0, 0};
   StringMapEntry<DwarfStringPoolEntry *> *StringEntry1 =
-      StringMapEntry<DwarfStringPoolEntry *>::Create("Key1", Allocator,
+      StringMapEntry<DwarfStringPoolEntry *>::create("Key1", Allocator,
                                                      &DwarfEntry1);
   DwarfStringPoolEntryRef Ref1(*StringEntry1);
 
   StringMapEntry<DwarfStringPoolEntry> *StringEntry2 =
-      StringMapEntry<DwarfStringPoolEntry>::Create(
+      StringMapEntry<DwarfStringPoolEntry>::create(
           "Key1", Allocator, DwarfStringPoolEntry{nullptr, 0, 0});
   DwarfStringPoolEntryRef Ref2(*StringEntry2);