@@ -266,7 +266,7 @@ static SILValue getTerminatorCondition(TermInst *Term) {
266
266
267
267
// / Is this basic block jump threadable.
268
268
static bool isThreadableBlock (SILBasicBlock *BB,
269
- SmallPtrSet <SILBasicBlock *, 32 > &LoopHeaders) {
269
+ SmallPtrSetImpl <SILBasicBlock *> &LoopHeaders) {
270
270
if (isa<ReturnInst>(BB->getTerminator ()))
271
271
return false ;
272
272
@@ -444,7 +444,7 @@ static SILValue createValueForEdge(SILInstruction *UserInst,
444
444
// / of the operand of 'DominatingBB's terminator.
445
445
static bool tryDominatorBasedSimplifications (
446
446
SILBasicBlock *DominatingBB, DominanceInfo *DT,
447
- SmallPtrSet <SILBasicBlock *, 32 > &LoopHeaders,
447
+ SmallPtrSetImpl <SILBasicBlock *> &LoopHeaders,
448
448
SmallVectorImpl<ThreadInfo> &JumpThreadableEdges,
449
449
llvm::DenseSet<std::pair<SILBasicBlock *, SILBasicBlock *>>
450
450
&ThreadedEdgeSet,
@@ -767,7 +767,7 @@ bool SimplifyCFG::simplifyAfterDroppingPredecessor(SILBasicBlock *BB) {
767
767
768
768
static NullablePtr<EnumElementDecl>
769
769
getEnumCaseRecursive (SILValue Val, SILBasicBlock *UsedInBB, int RecursionDepth,
770
- llvm::SmallPtrSet <SILArgument *, 8 > &HandledArgs) {
770
+ llvm::SmallPtrSetImpl <SILArgument *> &HandledArgs) {
771
771
// Limit the number of recursions. This is an easy way to cope with cycles
772
772
// in the SSA graph.
773
773
if (RecursionDepth > 3 )
0 commit comments