llvm.org GIT mirror llvm / e15a2ad
Revert r372893 "[CodeGen] Replace -max-jump-table-size with -max-jump-table-targets" This caused severe compile-time regressions, see PR43455. > Modern processors predict the targets of an indirect branch regardless of > the size of any jump table used to glean its target address. Moreover, > branch predictors typically use resources limited by the number of actual > targets that occur at run time. > > This patch changes the semantics of the option `-max-jump-table-size` to limit > the number of different targets instead of the number of entries in a jump > table. Thus, it is now renamed to `-max-jump-table-targets`. > > Before, when `-max-jump-table-size` was specified, it could happen that > cluster jump tables could have targets used repeatedly, but each one was > counted and typically resulted in tables with the same number of entries. > With this patch, when specifying `-max-jump-table-targets`, tables may have > different lengths, since the number of unique targets is counted towards the > limit, but the number of unique targets in tables is the same, but for the > last one containing the balance of targets. > > Differential revision: https://reviews.llvm.org/D60295 git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@373060 91177308-0d34-0410-b5e6-96231b3b80d8 Hans Wennborg 7 months ago
9 changed file(s) with 110 addition(s) and 107 deletion(s). Raw diff Collapse all Expand all
372372 (MaxCaseVal - MinCaseVal)
373373 .getLimitedValue(std::numeric_limits::max() - 1) + 1;
374374 // Check whether a range of clusters is dense enough for a jump table
375 if (TLI->isSuitableForJumpTable(&SI, N, 0, Range)) {
375 if (TLI->isSuitableForJumpTable(&SI, N, Range)) {
376376 JumpTableSize = Range;
377377 return 1;
378378 }
220220 Cases(std::move(C)), Prob(Pr) {}
221221 };
222222
223 /// Return the range of values within a range.
224 uint64_t getJumpTableRange(const CaseClusterVector &Clusters, unsigned First,
225 unsigned Last);
226
227 /// Return the number of cases within a range.
228 uint64_t getJumpTableNumCases(const SmallVectorImpl &TotalCases,
229 unsigned First, unsigned Last);
230
223231 struct SwitchWorkListItem {
224232 MachineBasicBlock *MBB;
225233 CaseClusterIt FirstCluster;
10211021 }
10221022
10231023 /// Return true if lowering to a jump table is suitable for a set of case
1024 /// clusters which may contain \p NumCases cases, \p Range range of values,
1025 /// \p NumTargets targets.
1026 virtual bool isSuitableForJumpTable(const SwitchInst *SI,
1027 uint64_t NumCases, uint64_t NumTargets,
1024 /// clusters which may contain \p NumCases cases, \p Range range of values.
1025 virtual bool isSuitableForJumpTable(const SwitchInst *SI, uint64_t NumCases,
10281026 uint64_t Range) const {
10291027 // FIXME: This function check the maximum table size and density, but the
10301028 // minimum size is not checked. It would be nice if the minimum size is
10331031 // getEstimatedNumberOfCaseClusters() in BasicTTIImpl.
10341032 const bool OptForSize = SI->getParent()->getParent()->hasOptSize();
10351033 const unsigned MinDensity = getMinimumJumpTableDensity(OptForSize);
1036 const unsigned MaxJumpTableTargets = getMaximumJumpTableTargets();
1037
1038 // Check whether the number of targets is small enough and
1034 const unsigned MaxJumpTableSize = getMaximumJumpTableSize();
1035
1036 // Check whether the number of cases is small enough and
10391037 // the range is dense enough for a jump table.
1040 if ((OptForSize || NumTargets <= MaxJumpTableTargets) &&
1041 NumCases * 100 >= Range * MinDensity)
1038 if ((OptForSize || Range <= MaxJumpTableSize) &&
1039 (NumCases * 100 >= Range * MinDensity)) {
10421040 return true;
1043
1041 }
10441042 return false;
10451043 }
10461044
15621560 /// Return lower limit of the density in a jump table.
15631561 unsigned getMinimumJumpTableDensity(bool OptForSize) const;
15641562
1565 /// Return upper limit for number of targets in a jump table.
1566 unsigned getMaximumJumpTableTargets() const;
1563 /// Return upper limit for number of entries in a jump table.
1564 /// Zero if no limit.
1565 unsigned getMaximumJumpTableSize() const;
15671566
15681567 virtual bool isJumpTableRelative() const {
15691568 return TM.isPositionIndependent();
19701969 /// Indicate the minimum number of blocks to generate jump tables.
19711970 void setMinimumJumpTableEntries(unsigned Val);
19721971
1973 /// Indicate the maximum number of targets in jump tables.
1974 void setMaximumJumpTableTargets(unsigned);
1972 /// Indicate the maximum number of entries in jump tables.
1973 /// Set to zero to generate unlimited jump tables.
1974 void setMaximumJumpTableSize(unsigned);
19751975
19761976 /// If set to a physical register, this specifies the register that
19771977 /// llvm.savestack/llvm.restorestack should save and restore.
1010 //
1111 //===----------------------------------------------------------------------===//
1212
13 #include "llvm/ADT/SmallSet.h"
1413 #include "llvm/CodeGen/MachineJumpTableInfo.h"
1514 #include "llvm/CodeGen/SwitchLoweringUtils.h"
1615
1716 using namespace llvm;
1817 using namespace SwitchCG;
1918
20 // Collection of partition stats, made up of, for a given cluster,
21 // the range of the cases, their number and the number of unique targets.
22 struct PartitionStats {
23 uint64_t Range, Cases, Targets;
24 };
25
26 static PartitionStats getJumpTableStats(const CaseClusterVector &Clusters,
27 unsigned First, unsigned Last,
28 bool HasReachableDefault) {
29 assert(Last >= First && "Invalid order of clusters");
30
31 SmallSet Targets;
32 PartitionStats Stats;
33
34 Stats.Cases = 0;
35 for (unsigned i = First; i <= Last; ++i) {
36 const APInt &Hi = Clusters[i].High->getValue(),
37 &Lo = Clusters[i].Low->getValue();
38 Stats.Cases += (Hi - Lo).getLimitedValue() + 1;
39
40 Targets.insert(Clusters[i].MBB);
41 }
42 assert(Stats.Cases < UINT64_MAX / 100 && "Too many cases");
43
44 const APInt &Hi = Clusters[Last].High->getValue(),
45 &Lo = Clusters[First].Low->getValue();
46 assert(Hi.getBitWidth() == Lo.getBitWidth());
47 Stats.Range = (Hi - Lo).getLimitedValue((UINT64_MAX - 1) / 100) + 1;
48 assert(Stats.Range >= Stats.Cases && "Invalid range or number of cases");
49
50 Stats.Targets =
51 Targets.size() + (HasReachableDefault && Stats.Range > Stats.Cases);
52
53 return Stats;
19 uint64_t SwitchCG::getJumpTableRange(const CaseClusterVector &Clusters,
20 unsigned First, unsigned Last) {
21 assert(Last >= First);
22 const APInt &LowCase = Clusters[First].Low->getValue();
23 const APInt &HighCase = Clusters[Last].High->getValue();
24 assert(LowCase.getBitWidth() == HighCase.getBitWidth());
25
26 // FIXME: A range of consecutive cases has 100% density, but only requires one
27 // comparison to lower. We should discriminate against such consecutive ranges
28 // in jump tables.
29 return (HighCase - LowCase).getLimitedValue((UINT64_MAX - 1) / 100) + 1;
30 }
31
32 uint64_t
33 SwitchCG::getJumpTableNumCases(const SmallVectorImpl &TotalCases,
34 unsigned First, unsigned Last) {
35 assert(Last >= First);
36 assert(TotalCases[Last] >= TotalCases[First]);
37 uint64_t NumCases =
38 TotalCases[Last] - (First == 0 ? 0 : TotalCases[First - 1]);
39 return NumCases;
5440 }
5541
5642 void SwitchCG::SwitchLowering::findJumpTables(CaseClusterVector &Clusters,
7763 if (N < 2 || N < MinJumpTableEntries)
7864 return;
7965
80 const bool HasReachableDefault =
81 !isa(DefaultMBB->getBasicBlock()->getFirstNonPHIOrDbg());
82 PartitionStats Stats =
83 getJumpTableStats(Clusters, 0, N - 1, HasReachableDefault);
66 // Accumulated number of cases in each cluster and those prior to it.
67 SmallVector TotalCases(N);
68 for (unsigned i = 0; i < N; ++i) {
69 const APInt &Hi = Clusters[i].High->getValue();
70 const APInt &Lo = Clusters[i].Low->getValue();
71 TotalCases[i] = (Hi - Lo).getLimitedValue() + 1;
72 if (i != 0)
73 TotalCases[i] += TotalCases[i - 1];
74 }
75
76 uint64_t Range = getJumpTableRange(Clusters,0, N - 1);
77 uint64_t NumCases = getJumpTableNumCases(TotalCases, 0, N - 1);
78 assert(NumCases < UINT64_MAX / 100);
79 assert(Range >= NumCases);
8480
8581 // Cheap case: the whole range may be suitable for jump table.
86 if (TLI->isSuitableForJumpTable(SI, Stats.Cases, Stats.Targets, Stats.Range)) {
82 if (TLI->isSuitableForJumpTable(SI, NumCases, Range)) {
8783 CaseCluster JTCluster;
8884 if (buildJumpTable(Clusters, 0, N - 1, SI, DefaultMBB, JTCluster)) {
8985 Clusters[0] = JTCluster;
107103 SmallVector MinPartitions(N);
108104 // LastElement[i] is the last element of the partition starting at i.
109105 SmallVector LastElement(N);
106 // PartitionsScore[i] is used to break ties when choosing between two
107 // partitionings resulting in the same number of partitions.
108 SmallVector PartitionsScore(N);
110109 // For PartitionsScore, a small number of comparisons is considered as good as
111110 // a jump table and a single comparison is considered better than a jump
112111 // table.
116115 FewCases = 1,
117116 SingleCase = 2
118117 };
119 // PartitionsScore[i] is used to break ties when choosing between two
120 // partitionings resulting in the same number of partitions.
121 SmallVector PartitionsScore(N);
122 // PartitionsStats[j] is the stats for the partition Clusters[i..j].
123 SmallVector PartitionsStats(N);
124118
125119 // Base case: There is only one way to partition Clusters[N-1].
126120 MinPartitions[N - 1] = 1;
134128 MinPartitions[i] = MinPartitions[i + 1] + 1;
135129 LastElement[i] = i;
136130 PartitionsScore[i] = PartitionsScore[i + 1] + PartitionScores::SingleCase;
137 for (int64_t j = i + 1; j < N; j++)
138 PartitionsStats[j] =
139 getJumpTableStats(Clusters, i, j, HasReachableDefault);
140131
141132 // Search for a solution that results in fewer partitions.
142133 for (int64_t j = N - 1; j > i; j--) {
143134 // Try building a partition from Clusters[i..j].
144 if (TLI->isSuitableForJumpTable(SI, PartitionsStats[j].Cases,
145 PartitionsStats[j].Targets,
146 PartitionsStats[j].Range)) {
135 Range = getJumpTableRange(Clusters, i, j);
136 NumCases = getJumpTableNumCases(TotalCases, i, j);
137 assert(NumCases < UINT64_MAX / 100);
138 assert(Range >= NumCases);
139
140 if (TLI->isSuitableForJumpTable(SI, NumCases, Range)) {
147141 unsigned NumPartitions = 1 + (j == N - 1 ? 0 : MinPartitions[j + 1]);
148142 unsigned Score = j == N - 1 ? 0 : PartitionsScore[j + 1];
149143 int64_t NumEntries = j - i + 1;
7171 ("min-jump-table-entries", cl::init(4), cl::Hidden,
7272 cl::desc("Set minimum number of entries to use a jump table."));
7373
74 static cl::opt MaximumJumpTableTargets
75 ("max-jump-table-targets", cl::init(UINT_MAX), cl::Hidden,
76 cl::desc("Set maximum number of targets to use in a jump table."));
74 static cl::opt MaximumJumpTableSize
75 ("max-jump-table-size", cl::init(UINT_MAX), cl::Hidden,
76 cl::desc("Set maximum size of jump tables."));
7777
7878 /// Minimum jump table density for normal functions.
7979 static cl::opt
17891789 MinimumJumpTableEntries = Val;
17901790 }
17911791
1792 unsigned TargetLoweringBase::getMaximumJumpTableTargets() const {
1793 return MaximumJumpTableTargets;
1794 }
1795
1796 void TargetLoweringBase::setMaximumJumpTableTargets(unsigned Val) {
1797 MaximumJumpTableTargets = Val;
1798 }
1799
18001792 unsigned TargetLoweringBase::getMinimumJumpTableDensity(bool OptForSize) const {
18011793 return OptForSize ? OptsizeJumpTableDensity : JumpTableDensity;
1794 }
1795
1796 unsigned TargetLoweringBase::getMaximumJumpTableSize() const {
1797 return MaximumJumpTableSize;
1798 }
1799
1800 void TargetLoweringBase::setMaximumJumpTableSize(unsigned Val) {
1801 MaximumJumpTableSize = Val;
18021802 }
18031803
18041804 //===----------------------------------------------------------------------===//
646646 setPrefFunctionAlignment(
647647 llvm::Align(1ULL << STI.getPrefFunctionLogAlignment()));
648648
649 // Only change the limit for targets in a jump table if specified by
649 // Only change the limit for entries in a jump table if specified by
650650 // the sub target, but not at the command line.
651 if (getMaximumJumpTableTargets() == UINT_MAX)
652 setMaximumJumpTableTargets(STI.getMaximumJumpTableTargets());
651 unsigned MaxJT = STI.getMaximumJumpTableSize();
652 if (MaxJT && getMaximumJumpTableSize() == UINT_MAX)
653 setMaximumJumpTableSize(MaxJT);
653654
654655 setHasExtractBitsInsn(true);
655656
9595 break;
9696 case ExynosM1:
9797 MaxInterleaveFactor = 4;
98 MaxJumpTableTargets = 8;
98 MaxJumpTableSize = 8;
9999 PrefFunctionLogAlignment = 4;
100100 PrefLoopLogAlignment = 3;
101101 break;
102102 case ExynosM3:
103103 MaxInterleaveFactor = 4;
104 MaxJumpTableTargets = 20;
104 MaxJumpTableSize = 20;
105105 PrefFunctionLogAlignment = 5;
106106 PrefLoopLogAlignment = 4;
107107 break;
199199 unsigned MaxPrefetchIterationsAhead = UINT_MAX;
200200 unsigned PrefFunctionLogAlignment = 0;
201201 unsigned PrefLoopLogAlignment = 0;
202 unsigned MaxJumpTableTargets = UINT_MAX;
202 unsigned MaxJumpTableSize = 0;
203203 unsigned WideningBaseCost = 0;
204204
205205 // ReserveXRegister[i] - X#i is not available as a general purpose register.
363363 }
364364 unsigned getPrefLoopLogAlignment() const { return PrefLoopLogAlignment; }
365365
366 unsigned getMaximumJumpTableTargets() const { return MaxJumpTableTargets; }
366 unsigned getMaximumJumpTableSize() const { return MaxJumpTableSize; }
367367
368368 unsigned getWideningBaseCost() const { return WideningBaseCost; }
369369
None ; RUN: llc %s -O2 -print-machineinstrs -mtriple=aarch64-linux-gnu -jump-table-density=40 -o /dev/null 2> %t; FileCheck %s --check-prefixes=CHECK,CHECK0 < %t
1 ; RUN: llc %s -O2 -print-machineinstrs -mtriple=aarch64-linux-gnu -jump-table-density=40 -max-jump-table-targets=4 -o /dev/null 2> %t; FileCheck %s --check-prefixes=CHECK,CHECK4 < %t
2 ; RUN: llc %s -O2 -print-machineinstrs -mtriple=aarch64-linux-gnu -jump-table-density=40 -max-jump-table-targets=8 -o /dev/null 2> %t; FileCheck %s --check-prefixes=CHECK,CHECK8 < %t
3 ; RUN: llc %s -O2 -print-machineinstrs -mtriple=aarch64-linux-gnu -jump-table-density=40 -max-jump-table-targets=16 -o /dev/null 2> %t; FileCheck %s --check-prefixes=CHECK,CHECK16 < %t
4 ; RUN: llc %s -O2 -print-machineinstrs -mtriple=aarch64-linux-gnu -jump-table-density=40 -mcpu=exynos-m1 -o /dev/null 2> %t; FileCheck %s --check-prefixes=CHECK,CHECKM1 < %t
5 ; RUN: llc %s -O2 -print-machineinstrs -mtriple=aarch64-linux-gnu -jump-table-density=40 -mcpu=exynos-m3 -o /dev/null 2> %t; FileCheck %s --check-prefixes=CHECK,CHECKM3 < %t
0 ; RUN: llc %s -O2 -print-machineinstrs -mtriple=aarch64-linux-gnu -jump-table-density=40 -o /dev/null 2> %t; FileCheck %s --check-prefixes=CHECK,CHECK0 < %t
1 ; RUN: llc %s -O2 -print-machineinstrs -mtriple=aarch64-linux-gnu -jump-table-density=40 -max-jump-table-size=4 -o /dev/null 2> %t; FileCheck %s --check-prefixes=CHECK,CHECK4 < %t
2 ; RUN: llc %s -O2 -print-machineinstrs -mtriple=aarch64-linux-gnu -jump-table-density=40 -max-jump-table-size=8 -o /dev/null 2> %t; FileCheck %s --check-prefixes=CHECK,CHECK8 < %t
3 ; RUN: llc %s -O2 -print-machineinstrs -mtriple=aarch64-linux-gnu -jump-table-density=40 -max-jump-table-size=16 -o /dev/null 2> %t; FileCheck %s --check-prefixes=CHECK,CHECK16 < %t
4 ; RUN: llc %s -O2 -print-machineinstrs -mtriple=aarch64-linux-gnu -jump-table-density=40 -mcpu=exynos-m1 -o /dev/null 2> %t; FileCheck %s --check-prefixes=CHECK,CHECKM1 < %t
5 ; RUN: llc %s -O2 -print-machineinstrs -mtriple=aarch64-linux-gnu -jump-table-density=40 -mcpu=exynos-m3 -o /dev/null 2> %t; FileCheck %s --check-prefixes=CHECK,CHECKM3 < %t
66
77 declare void @ext(i32, i32)
88
8585 ; CHECK0-NOT: %jump-table.1:
8686 ; CHECK4-NEXT: %jump-table.0: %bb.1 %bb.2 %bb.3 %bb.4{{$}}
8787 ; CHECK4-NOT: %jump-table.1:
88 ; CHECK8-NEXT: %jump-table.0: %bb.1 %bb.2 %bb.3 %bb.4 %bb.7 %bb.7 %bb.7 %bb.7 %bb.7 %bb.7 %bb.7 %bb.7 %bb.7 %bb.5 %bb.6{{$}}
88 ; CHECK8-NEXT: %jump-table.0: %bb.1 %bb.2 %bb.3 %bb.4{{$}}
8989 ; CHECK8-NOT: %jump-table.1:
9090 ; CHECK16-NEXT: %jump-table.0: %bb.1 %bb.2 %bb.3 %bb.4 %bb.7 %bb.7 %bb.7 %bb.7 %bb.7 %bb.7 %bb.7 %bb.7 %bb.7 %bb.5 %bb.6{{$}}
9191 ; CHECK16-NOT: %jump-table.1:
92 ; CHECKM1-NEXT: %jump-table.0: %bb.1 %bb.2 %bb.3 %bb.4 %bb.7 %bb.7 %bb.7 %bb.7 %bb.7 %bb.7 %bb.7 %bb.7 %bb.7 %bb.5 %bb.6{{$}}
92 ; CHECKM1-NEXT: %jump-table.0: %bb.1 %bb.2 %bb.3 %bb.4{{$}}
9393 ; CHECKM1-NOT: %jump-table.1:
9494 ; CHECKM3-NEXT: %jump-table.0: %bb.1 %bb.2 %bb.3 %bb.4 %bb.7 %bb.7 %bb.7 %bb.7 %bb.7 %bb.7 %bb.7 %bb.7 %bb.7 %bb.5 %bb.6{{$}}
9595 ; CHECKM3-NOT: %jump-table.1:
101101 bb4: tail call void @ext(i32 3, i32 4) br label %return
102102 bb5: tail call void @ext(i32 2, i32 5) br label %return
103103 bb6: tail call void @ext(i32 1, i32 6) br label %return
104
105104 return: ret void
106105 }
107106
131130 ; CHECK4-NEXT: %jump-table.0: %bb.1 %bb.2 %bb.3 %bb.4
132131 ; CHECK4-NEXT: %jump-table.1: %bb.5 %bb.6 %bb.7 %bb.8
133132 ; CHECK4-NOT: %jump-table.2:
134 ; CHECK8-NEXT: %jump-table.0: %bb.1 %bb.2 %bb.3 %bb.4 %bb.13 %bb.13 %bb.13 %bb.13 %bb.13 %bb.13 %bb.13 %bb.13 %bb.13 %bb.5 %bb.6 %bb.7
135 ; CHECK8-NEXT: %jump-table.1: %bb.8 %bb.13 %bb.9 %bb.10 %bb.13 %bb.11 %bb.12
133 ; CHECK8-NEXT: %jump-table.0: %bb.1 %bb.2 %bb.3 %bb.4
134 ; CHECK8-NEXT: %jump-table.1: %bb.5 %bb.6 %bb.7 %bb.8 %bb.13 %bb.9 %bb.10
136135 ; CHECK8-NOT: %jump-table.2:
137 ; CHECK16-NEXT: %jump-table.0: %bb.1 %bb.2 %bb.3 %bb.4 %bb.13 %bb.13 %bb.13 %bb.13 %bb.13 %bb.13 %bb.13 %bb.13 %bb.13 %bb.5 %bb.6 %bb.7 %bb.8 %bb.13 %bb.9 %bb.10 %bb.13 %bb.11 %bb.12
138 ; CHECK16-NOT: %jump-table.1:
139 ; CHECKM1-NEXT: %jump-table.0: %bb.1 %bb.2 %bb.3 %bb.4 %bb.13 %bb.13 %bb.13 %bb.13 %bb.13 %bb.13 %bb.13 %bb.13 %bb.13 %bb.5 %bb.6 %bb.7
140 ; CHECKM1-NEXT: %jump-table.1: %bb.8 %bb.13 %bb.9 %bb.10 %bb.13 %bb.11 %bb.12
136 ; CHECK16-NEXT: %jump-table.0: %bb.1 %bb.2 %bb.3 %bb.4 %bb.13 %bb.13 %bb.13 %bb.13 %bb.13 %bb.13 %bb.13 %bb.13 %bb.13 %bb.5 %bb.6 %bb.7
137 ; CHECK16-NEXT: %jump-table.1: %bb.8 %bb.13 %bb.9 %bb.10 %bb.13 %bb.11 %bb.12
138 ; CHECK16-NOT: %jump-table.2:
139 ; CHECKM1-NEXT: %jump-table.0: %bb.1 %bb.2 %bb.3 %bb.4
140 ; CHECKM1-NEXT: %jump-table.1: %bb.5 %bb.6 %bb.7 %bb.8 %bb.13 %bb.9 %bb.10
141141 ; CHECKM1-NOT: %jump-table.2:
142142 ; CHECKM3-NEXT: %jump-table.0: %bb.1 %bb.2 %bb.3 %bb.4 %bb.13 %bb.13 %bb.13 %bb.13 %bb.13 %bb.13 %bb.13 %bb.13 %bb.13 %bb.5 %bb.6 %bb.7 %bb.8 %bb.13 %bb.9 %bb.10
143143 ; CHECKM3-NOT: %jump-table.1:
184184 ; CHECK0-NOT: %jump-table.1:
185185 ; CHECK4-NEXT: %jump-table.0: %bb.1 %bb.2 %bb.3 %bb.4
186186 ; CHECK4-NEXT: %jump-table.1: %bb.5 %bb.6 %bb.7 %bb.8
187 ; CHECK4-NEXT: %jump-table.2: %bb.9 %bb.10 %bb.13 %bb.11 %bb.12
188 ; CHECK4-NOT: %jump-table.3:
189 ; CHECK8-NEXT: %jump-table.0: %bb.1 %bb.2 %bb.3 %bb.4 %bb.13 %bb.13 %bb.13 %bb.13 %bb.13 %bb.13 %bb.13 %bb.13 %bb.13 %bb.5 %bb.6 %bb.7 %bb.8
190 ; CHECK8-NEXT: %jump-table.1: %bb.9 %bb.10 %bb.13 %bb.11 %bb.12
187 ; CHECK4-NOT: %jump-table.2:
188 ; CHECK8-NEXT: %jump-table.0: %bb.1 %bb.2 %bb.3 %bb.4
189 ; CHECK8-NEXT: %jump-table.1: %bb.5 %bb.6 %bb.7 %bb.8 %bb.13 %bb.9 %bb.10
191190 ; CHECK8-NOT: %jump-table.2:
192 ; CHECK16-NEXT: %jump-table.0: %bb.1 %bb.2 %bb.3 %bb.4 %bb.13 %bb.13 %bb.13 %bb.13 %bb.13 %bb.13 %bb.13 %bb.13 %bb.13 %bb.5 %bb.6 %bb.7 %bb.8 %bb.13 %bb.9 %bb.10 %bb.13 %bb.11 %bb.12
193 ; CHECK16-NOT: %jump-table.1:
194 ; CHECKM1-NEXT: %jump-table.0: %bb.1 %bb.2 %bb.3 %bb.4 %bb.13 %bb.13 %bb.13 %bb.13 %bb.13 %bb.13 %bb.13 %bb.13 %bb.13 %bb.5 %bb.6 %bb.7 %bb.8
195 ; CHECKM1-NEXT: %jump-table.1: %bb.9 %bb.10 %bb.13 %bb.11 %bb.12
191 ; CHECK16-NEXT: %jump-table.0: %bb.1 %bb.2 %bb.3 %bb.4 %bb.13 %bb.13 %bb.13 %bb.13 %bb.13 %bb.13 %bb.13 %bb.13 %bb.13 %bb.5 %bb.6 %bb.7
192 ; CHECK16-NEXT: %jump-table.1: %bb.8 %bb.13 %bb.9 %bb.10 %bb.13 %bb.11 %bb.12
193 ; CHECK16-NOT: %jump-table.2:
194 ; CHECKM1-NEXT: %jump-table.0: %bb.1 %bb.2 %bb.3 %bb.4
195 ; CHECKM1-NEXT: %jump-table.1: %bb.5 %bb.6 %bb.7 %bb.8 %bb.13 %bb.9 %bb.10
196196 ; CHECKM1-NOT: %jump-table.2:
197197 ; CHECKM3-NEXT: %jump-table.0: %bb.1 %bb.2 %bb.3 %bb.4 %bb.13 %bb.13 %bb.13 %bb.13 %bb.13 %bb.13 %bb.13 %bb.13 %bb.13 %bb.5 %bb.6 %bb.7 %bb.8 %bb.13 %bb.9 %bb.10
198198 ; CHECKM3-NOT: %jump-table.1: