[Pass] Rename lowerswitch -> lower-switch

Author: paperchalice

llvm/docs/Passes.rst

@@ -748,8 +748,8 @@ support stack unwinding.  This pass converts ``invoke`` instructions to
 become dead code (which can be removed by running the ``-simplifycfg`` pass
 afterwards).
 
-``lowerswitch``: Lower ``SwitchInst``\ s to branches
-----------------------------------------------------
+``lower-switch``: Lower ``SwitchInst``\ s to branches
+-----------------------------------------------------
 
 Rewrites switch instructions with a sequence of branches, which allows targets
 to get away with not implementing the switch instruction until it is

llvm/lib/Passes/PassBuilder.cpp

@@ -1296,7 +1296,8 @@ static bool isLoopPassName(StringRef Name, CallbacksT &Callbacks,
 
 static StringRef convertToNewPassName(StringRef OldName) {
   static StringMap<StringRef> NameMap = {{"loweratomic", "lower-atomic"},
-                                         {"lowerinvoke", "lower-invoke"}};
+                                         {"lowerinvoke", "lower-invoke"},
+                                         {"lowerswitch", "lower-switch"}};
 
   if (auto I = NameMap.find(OldName); I != NameMap.end()) {
     auto NewName = I->second;

llvm/lib/Passes/PassRegistry.def

@@ -338,8 +338,8 @@ FUNCTION_PASS("lower-constant-intrinsics", LowerConstantIntrinsicsPass())
 FUNCTION_PASS("lower-expect", LowerExpectIntrinsicPass())
 FUNCTION_PASS("lower-guard-intrinsic", LowerGuardIntrinsicPass())
 FUNCTION_PASS("lower-invoke", LowerInvokePass())
+FUNCTION_PASS("lower-switch", LowerSwitchPass())
 FUNCTION_PASS("lower-widenable-condition", LowerWidenableConditionPass())
-FUNCTION_PASS("lowerswitch", LowerSwitchPass())
 FUNCTION_PASS("make-guards-explicit", MakeGuardsExplicitPass())
 FUNCTION_PASS("mem2reg", PromotePass())
 FUNCTION_PASS("memcpyopt", MemCpyOptPass())

llvm/test/Transforms/FixIrreducible/switch.ll

@@ -1,5 +1,5 @@
 ; NOTE: Assertions have been autogenerated by utils/update_test_checks.py
-; RUN: opt < %s -passes='lowerswitch,fix-irreducible' -S | FileCheck %s
+; RUN: opt < %s -passes='lower-switch,fix-irreducible' -S | FileCheck %s
 
 define void @loop_1(i32 %Value, i1 %PredEntry, i1 %PredD) {
 ; CHECK-LABEL: @loop_1(

llvm/test/Transforms/LowerSwitch/2003-05-01-PHIProblem.ll

@@ -1,4 +1,4 @@
-; RUN: opt < %s -passes=lowerswitch
+; RUN: opt < %s -passes=lower-switch
 
 define void @child(i32 %ct.1) {
 entry:

llvm/test/Transforms/LowerSwitch/2003-08-23-EmptySwitch.ll

@@ -1,4 +1,4 @@
-; RUN: opt < %s -passes=lowerswitch
+; RUN: opt < %s -passes=lower-switch
 
 define void @test() {
 	switch i32 0, label %Next [

llvm/test/Transforms/LowerSwitch/2004-03-13-SwitchIsDefaultCrash.ll

@@ -1,4 +1,4 @@
-; RUN: opt < %s -passes=lowerswitch -disable-output
+; RUN: opt < %s -passes=lower-switch -disable-output
 
 define void @solve() {
 entry:

llvm/test/Transforms/LowerSwitch/2014-06-10-SwitchContiguousOpt.ll

@@ -1,4 +1,4 @@
-; RUN: opt < %s -passes=lowerswitch -S | FileCheck %s
+; RUN: opt < %s -passes=lower-switch -S | FileCheck %s
 ; CHECK-NOT: icmp eq i32 %0, 1
 
 define i32 @foo(i32 %a) #0 {

llvm/test/Transforms/LowerSwitch/2014-06-11-SwitchDefaultUnreachableOpt.ll

@@ -1,4 +1,4 @@
-; RUN: opt < %s -passes=lowerswitch -S | FileCheck %s
+; RUN: opt < %s -passes=lower-switch -S | FileCheck %s
 ;
 ; The switch is lowered with a single icmp.
 ; CHECK: icmp

llvm/test/Transforms/LowerSwitch/2014-06-23-PHIlowering.ll

@@ -1,4 +1,4 @@
-; RUN: opt < %s -passes=lowerswitch -S | FileCheck %s
+; RUN: opt < %s -passes=lower-switch -S | FileCheck %s
 
 define i32 @test(i32 %arg) #0 {
 ; CHECK-LABEL: @test

llvm/test/Transforms/LowerSwitch/condition-phi-unreachable-default.ll

@@ -1,6 +1,6 @@
-; RUN: opt < %s -passes=lowerswitch -S | FileCheck %s
+; RUN: opt < %s -passes=lower-switch -S | FileCheck %s
 
-; This test verifies -lowerswitch does not crash when an removing an
+; This test verifies -lower-switch does not crash when an removing an
 ; unreachable default branch causes a PHI node used as the switch
 ; condition to be erased.
 

llvm/test/Transforms/LowerSwitch/delete-default-block-crash.ll

@@ -1,6 +1,6 @@
-; RUN: opt < %s -passes=lowerswitch -disable-output
+; RUN: opt < %s -passes=lower-switch -disable-output
 
-; This test verify -lowerswitch does not crash after deleting the default block.
+; This test verify -lower-switch does not crash after deleting the default block.
 
 declare i32 @f(i32)
 

llvm/test/Transforms/LowerSwitch/do-not-handle-impossible-values.ll

@@ -1,5 +1,5 @@
 ; NOTE: Assertions have been autogenerated by utils/update_test_checks.py
-; RUN: opt < %s -passes=lowerswitch -S | FileCheck %s
+; RUN: opt < %s -passes=lower-switch -S | FileCheck %s
 
 ; Check that we do not generate redundant comparisons that would have results
 ; known at compile time due to limited range of the value being switch'ed over.

llvm/test/Transforms/LowerSwitch/feature.ll

@@ -1,4 +1,4 @@
-; RUN: opt < %s -passes=lowerswitch -S | FileCheck %s
+; RUN: opt < %s -passes=lower-switch -S | FileCheck %s
 
 ; We have switch on input.
 ; On output we should got binary comparison tree. Check that all is fine.

llvm/test/Transforms/LowerSwitch/fold-popular-case-to-unreachable-default.ll

@@ -1,4 +1,4 @@
-; RUN: opt %s -passes=lowerswitch -S | FileCheck %s
+; RUN: opt %s -passes=lower-switch -S | FileCheck %s
 
 define void @foo(i32 %x, ptr %p) {
 ; Cases 2 and 4 are removed and become the new default case.

llvm/test/Transforms/LowerSwitch/phi-in-dead-block.ll

@@ -1,4 +1,4 @@
-; RUN: opt -S -passes=lowerswitch %s | FileCheck %s
+; RUN: opt -S -passes=lower-switch %s | FileCheck %s
 
 ; CHECK-LABEL: @phi_in_dead_block(
 ; CHECK-NOT: switch

llvm/test/Transforms/LowerSwitch/pr59316.ll

@@ -1,5 +1,5 @@
 ; NOTE: Assertions have been autogenerated by utils/update_test_checks.py
-; RUN: opt < %s -passes=lowerswitch -S | FileCheck %s
+; RUN: opt < %s -passes=lower-switch -S | FileCheck %s
 
 define i64 @f(i1 %bool, i128 %i128) {
 ; CHECK-LABEL: @f(

llvm/test/Transforms/StructurizeCFG/switch.ll

@@ -1,4 +1,4 @@
-; RUN: opt -S -passes='lowerswitch,structurizecfg' %s -o - | FileCheck %s
+; RUN: opt -S -passes='lower-switch,structurizecfg' %s -o - | FileCheck %s
 
 ; The structurizecfg pass cannot handle switch instructions, so we need to
 ; make sure the lower switch pass is always run before structurizecfg.

llvm/test/Transforms/UnifyFunctionExitNodes/unreachable-blocks-status.ll

@@ -1,4 +1,4 @@
-; RUN: opt -passes='break-crit-edges,lowerswitch,mergereturn' -S < %s | FileCheck %s
+; RUN: opt -passes='break-crit-edges,lower-switch,mergereturn' -S < %s | FileCheck %s
 
 ; The pass did previously not report the correct Modified status in the case
 ; where a function had at most one return block, and an unified unreachable

llvm/test/Transforms/UnifyLoopExits/basic.ll

@@ -1,5 +1,5 @@
 ; NOTE: Assertions have been autogenerated by utils/update_test_checks.py
-; RUN: opt < %s -passes='lowerswitch,unify-loop-exits' -S | FileCheck %s
+; RUN: opt < %s -passes='lower-switch,unify-loop-exits' -S | FileCheck %s
 
 define void @loop_1(i1 %PredEntry, i1 %PredB, i1 %PredC, i1 %PredD) {
 ; CHECK-LABEL: @loop_1(

llvm/test/Transforms/UnifyLoopExits/nested.ll

@@ -1,5 +1,5 @@
 ; NOTE: Assertions have been autogenerated by utils/update_test_checks.py
-; RUN: opt < %s -passes='lowerswitch,unify-loop-exits' -S | FileCheck %s
+; RUN: opt < %s -passes='lower-switch,unify-loop-exits' -S | FileCheck %s
 
 define void @nested(i1 %PredB3, i1 %PredB4, i1 %PredA4, i1 %PredA3, i32 %X, i32 %Y, i32 %Z) {
 ; CHECK-LABEL: @nested(

llvm/test/Transforms/UnifyLoopExits/restore-ssa.ll

@@ -1,5 +1,5 @@
 ; NOTE: Assertions have been autogenerated by utils/update_test_checks.py
-; RUN: opt < %s -passes='lowerswitch,unify-loop-exits' -S | FileCheck %s
+; RUN: opt < %s -passes='lower-switch,unify-loop-exits' -S | FileCheck %s
 
 ; Loop consists of A and B:
 ; - A is the header

llvm/test/Transforms/UnifyLoopExits/switch.ll

@@ -1,5 +1,5 @@
 ; NOTE: Assertions have been autogenerated by utils/update_test_checks.py
-; RUN: opt < %s -passes='lowerswitch,unify-loop-exits' -S | FileCheck %s
+; RUN: opt < %s -passes='lower-switch,unify-loop-exits' -S | FileCheck %s
 
 define void @loop_1(i32 %Value, i1 %PredEntry, i1 %PredD) {
 ; CHECK-LABEL: @loop_1(

llvm/test/Transforms/Util/lowerswitch.ll

@@ -1,4 +1,4 @@
-; RUN: opt -passes=lowerswitch -S < %s | FileCheck %s
+; RUN: opt -passes=lower-switch -S < %s | FileCheck %s
 
 ; Test that we don't crash and have a different basic block for each incoming edge.
 define void @test0(i32 %mode) {
@@ -31,7 +31,7 @@ BB3:
   br label %BB2
 }
 
-; Test switch cases that are merged into a single case during lowerswitch
+; Test switch cases that are merged into a single case during lower-switch
 ; (take 84 and 85 below) - check that the number of incoming phi values match
 ; the number of branches.
 define void @test1(i32 %mode) {
@@ -198,7 +198,7 @@ define void @test2(i32 %mode, i1 %c1, i1 %c2, i1 %c3, i1 %c4, i1 %c5, i1 %c6) {
 }
 
 ; Test that the PHI node in for.cond should have one entry for each predecessor
-; of its parent basic block after lowerswitch merged several cases into a new
+; of its parent basic block after lower-switch merged several cases into a new
 ; default block.
 define void @test3(i32 %mode, i1 %c1, i1 %c2) {
 ; CHECK-LABEL: @test3